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).
43376764
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval
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.
16635301
Extreme video retrieval: joint maximization of human and computer performance
We present an efficient system for video search that maximizes the use of human bandwidth, while at the same time exploiting the machine's ability to learn in real-time from user selected relevant video clips. The system exploits the human capability for rapidly scanning imagery augmenting it with an active learning loop, which attempts to always present the most relevant material based on the current information. Two versions of the human interface were evaluated, one with variable page sizes and manual paging, the other with a fixed page size and automatic paging. Both require absolute attention and focus of the user for optimal performance. In either case, as users search and find relevant results, the system can invisibly re-rank its previous best guesses using a number of knowledge sources, such as image similarity, text similarity, and temporal proximity. Experimental evidence shows a significant improvement using the combined extremes of human and machine power over either approach alone.
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.
5733804
Video Classification and Retrieval with the Informedia Digital Video Library System
This paper is organized in three parts. The first part details some of the lower level shot classification work, the second part describes the ‘manual’ retrieval systems while the last section details the interactive retrieval system for the Carnegie Mellon University TREC Video Retrieval Track runs. The description of the data can be found elsewhere in the proceedings of the 2002 TREC conference video track overview.
17407468
Analysis of two restart algorithms
Abstract Since the backpropagation algorithm used for neural network training suffers from a slow convergence and often sticking in local minima, the restart mechanism has been introduced, whose strategy is to cut off the training process and restart it with a fresh initialization when it seems unlikely to converge in a relatively short time. In this paper, we give detailed mathematical analysis on two versions of the restart algorithms. By deriving analytic expressions of the expected convergence time and the success rate, we illustrate why the restart algorithms work well and gain insights into the proper use of restarting. Numerical simulations are performed on the XOR problem, symmetry detection, parity problem and Arabic numeral recognition. We show the effectiveness of the restart algorithms, and compare them with simulated annealing. The analysis can also be applied to many other fields.
14184014
Meta-Classification of Multimedia Classifiers
Combining multiple classifiers is of particular interest in the multimedia systems, since there is usually data of very different types/modalities that should be mined or analyzed. Our wearable ‘experience collection’ system unobtrusively records the wearer’s conversation, recognizes the face of the dialog partner and remembers his/her voice. When the system sees the same person’s face or hears the same voice it can then use a summary of the last conversation with this person to remind the wearer. To correctly identify a person from a mixture of video and audio stream, classification judgments from individual modality classifiers must be combined effectively to yield a more accurate decision. To address the problems of combination strategy in previous studies, a meta-classification strategy using Support Vector Machine is proposed. Preliminary results show that combining different face recognition and speaker identification technology by meta-classification is dramatically more effective than weighted interpolation. Meta-classification is general enough to be applied to any application that needs to combine multiple classifiers without much modification.