共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
3.
4.
5.
6.
Hong-Jian Lai Hao Li Ping Li Yanting Liang Senmei Yao 《Information Processing Letters》2011,111(23-24):1085-1088
Jaeger in 1984 conjectured that every -edge-connected graph has a mod -orientation. It has also been conjectured that every -edge-connected graph is mod -contractible. In [Z.-H. Chen, H.-J. Lai, H. Lai, Nowhere zero flows in line graphs, Discrete Math. 230 (2001) 133–141], it has been proved that if G has a nowhere-zero 3-flow and the minimum degree of G is at least 4, then also has a nowhere-zero 3-flow. In this paper, we prove that the above conjectures on line graphs would imply the truth of the conjectures in general, and we also prove that if G has a mod -orientation and , then also has a mod -orientation, which extends a result in Chen et al. (2001) [2]. 相似文献
7.
8.
9.
10.
11.
12.
13.
14.
15.
Textures are among the most important visual attributes in image analysis. This paper presents a novel method to analyze texture, based on representing states of a simplified gravitational collapse from an image and extracting information from each state using fractal dimension. In this approach, an image evolves in times , each time representing a state, which is explored by the Bouligand–Minkowski method using radius . These parameters allow to create a set of feature vectors, which were extracted from Brodatz's textures and leaf textures. The best classification results were 98.75% and 86.67% of success rate (percentage of samples correctly classified) for these two databases, respectively. These results prove that the proposed approach opens a promising source of research in texture analysis to be explored. 相似文献
16.
17.
Wenjie Li Zhenkun Zhang Hailing Liu Jinjiang Yuan 《Information Processing Letters》2012,112(12):503-508
This paper studies the online scheduling of equal-length jobs with incompatible families on multiple batch machines which can process the jobs from a common family in batches, where each batch has a capacity b with in the unbounded batching and in the bounded batching. Each job J has an equal-length integral processing time , an integral release time , an integral deadline and a real weight . The goal is to determine a preemptive schedule with restart which maximizes the weighted number of early jobs. When , we show that a simple greedy online algorithm has a competitive ratio 2, and establish the lower bound . This means that the greedy algorithm is of the best possible for . When p is any positive integer, we provide an online algorithm of competitive ratio for both and . This is the first online algorithm for the problem with a constant competitive ratio. 相似文献
18.
19.