7150656
Neighborhood Union Condition with Distance for Vertex-pancyclicity
35614975
Circular chromatic numbers of some distance graphs
Given a set D of positive integers, the distance graph G(Z,D) has vertices all integers Z, and two vertices j and j^' in Z are adjacent if and only if |j-j^'|@?D. This paper determines the circular chromatic numbers of some distance graphs.
44850173
Some star extremal circulant graphs
The circular chromatic number @g"c(G) and the fractional chromatic number @g"f(G) are two generalizations of the ordinary chromatic number of a graph G. A graph is called star extremal if its circular chromatic number equals its fractional chromatic number. Gao and Zhu (Discrete Math. 152 (1996) 147-156), Lih et al. (SIAM J. Discrete Math. 12 (1999) 491-499) gave many classes of circulant graphs which are star extremal. In this paper, we study the star extremality of circulant graphs whose generating sets are of the form {1,2,...,m-1,k,k+1,...,k+m-2}, {k,k+1,...,k'}, and {k,k+1,...,k"1,k"2,k"2+1,...,@?p/[email protected]?}, where p is the vertex number of the graph. As a corollary, we give an improvement of a result of Gao and Zhu (Discrete Math. 152 (1996) 147-156).
29051005
Neighbourhood Unions and Edge-Pancyclicity
43376764
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval
33577652
Coloring of distance graphs with intervals as distance sets
Let D be a set of positive integers. The distance graph G(Z, D) with distance set D is the graph with vertex set Z in which two vertices x, y are adjacent if and only if |x - y| ∈ D. The fractional chromatic number, the chromatic number, and the circular chromatic number of G(Z, D) for various D have been extensively studied recently. In this paper, we investigate the fractional chromatic number, the chromatic number, and the circular chromatic number of the distance graphs with the distance sets of the form Dm, [k,k'] = {1, 2, ..., m} - {k, k + 1, ..., k'}, where m, k, and k' are natural numbers with m ≥ k' ≥ k. In particular, we completely determine the chromatic number of G(Z, Dm, [2,k']) for arbitrary m, and k'.
13267635
A Top-Down Processor Allocation Scheme for Hypercube Computers
An efficient processor allocation policy is presented for hypercube computers. The allocation policy is called free list since it maintains a list of free subcubes available in the system. An incoming request of dimension k (2/sup k/ nodes) is allocated by finding a free subcube of dimension k or by decomposing an available subcube of dimension greater than k. This free list policy uses a top-down allocation rule in contrast to the bottom-up approach used by the previous bit-map allocation algorithms. This allocation scheme is compared to the buddy, gray code (GC), and modified buddy allocation policies reported for the hypercubes. It is shown that the free list policy is optimal in a static environment, as are the other policies, and it also gives better subcube recognition ability compared to the previous schemes in a dynamic environment. The performance of this policy, in terms of parameters such as average delay, system utilization, and time complexity, is compared to the other schemes to demonstrate its effectiveness. The extension of the algorithm for parallel implementation, noncubic allocation, and inclusion/exclusion allocation is also given. >
8970570
Near-regular texture analysis and manipulation
A near-regular texture deviates geometrically and photometrically from a regular congruent tiling. Although near-regular textures are ubiquitous in the man-made and natural world, they present computational challenges for state of the art texture analysis and synthesis algorithms. Using regular tiling as our anchor point, and with user-assisted lattice extraction, we can explicitly model the deformation of a near-regular texture with respect to geometry, lighting and color. We treat a deformation field both as a function that acts on a texture and as a texture that is acted upon, and develop a multi-modal framework where each deformation field is subject to analysis, synthesis and manipulation. Using this formalization, we are able to construct simple parametric models to faithfully synthesize the appearance of a near-regular texture and purposefully control its regularity.
14446570
Communication-Efficient Vector Manipulations on Binary N-Cubes
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-se nsitive hash functions for various metrics have been given: project ing an n-cube ontok bits is simple hash function that performs well. In this paper we investigate alternatives to projection. For various parameters hash functions given by complete decodi ng algorithms for codes work better, and asymptotically random codes perform better than projection.
7971802
Modeling timing features in broadcast news video classification
Broadcast news programs are well-structured video, and timing can be a strong predictor for specific types of news reports. However, learning a classifier using timing features may not be an easy task when training data are noisy. We approach the problem from the generative model perspective, and approximate the class density in a non-parametric fashion. The results show that timing is a simple but extremely effective feature, and our method can achieve significantly better performance than a discriminative classifier.
15531618
Assessing Effectiveness in Video Retrieval
This paper examines results from the last two years of the TRECVID video retrieval evaluations. While there is encouraging evidence about progress in video retrieval, there are several major disappointments confirming that the field of video retrieval is still in its infancy. Many publications blithely attribute improvements in retrieval tasks to the different techniques without paying much attention to the statistical reliability of the comparisons. We conduct an analysis of the official TRECVID evaluation results, using both retrieval experiment error rates and ANOVA measures, and demonstrate that the difference between many systems is not statistically significant. We conclude the paper with the lessons learned from both results with and without statistically significant difference.