Sciweavers

1363 search results - page 137 / 273
» The road coloring problem
Sort
View
IJCAI
2001
15 years 7 months ago
Backbones in Optimization and Approximation
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
John K. Slaney, Toby Walsh
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 6 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
ICPR
2002
IEEE
16 years 7 months ago
Bayesian Pot-Assembly from Fragments as Problems in Perceptual-Grouping and Geometric-Learning
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
David B. Cooper, Andrew R. Willis, Stuart Andrews,...
CVPR
2010
IEEE
16 years 2 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...
CVPR
2010
IEEE
15 years 3 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...