Sciweavers

263 search results - page 39 / 53
» Minimum Entropy Coloring
Sort
View
FSS
2008
89views more  FSS 2008»
14 years 11 months ago
On the equivalence of some approaches to the OWA operator and RIM quantifier determination
The ordered weighted averaging (OWA) operator is a widely used aggregation method, and its determination is usually a prerequisite step in many related applications. The regular i...
Xinwang Liu, Hongwei Lou
ICCV
2003
IEEE
16 years 1 months ago
Shape Gradients for Histogram Segmentation using Active Contours
We consider the problem of image segmentation using active contours through the minimization of an energy criterion involving both region and boundary functionals. These functiona...
Stéphanie Jehan-Besson, Michel Barlaud, Gil...
ICMCS
2005
IEEE
177views Multimedia» more  ICMCS 2005»
15 years 5 months ago
Comparison of Visual Features and Fusion Techniques in Automatic Detection of Concepts from News Video
This study describes experiments on automatic detection of semantic concepts, which are textual descriptions about the digital video content. The concepts can be further used in c...
Mika Rautiainen, Tapio Seppänen
DISOPT
2010
129views more  DISOPT 2010»
14 years 11 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
SPAA
2003
ACM
15 years 5 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman