Sciweavers

1603 search results - page 258 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
COCOON
2010
Springer
15 years 2 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
ICCV
2001
IEEE
16 years 19 hour ago
Stereoscopic Segmentation
We cast the problem of multiframe stereo reconstruction of a smooth shape as the global region segmentation of a collection of images of the scene. Dually, the problem of segmenti...
Anthony J. Yezzi, Stefano Soatto
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
15 years 10 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ACML
2009
Springer
15 years 4 months ago
Coupled Metric Learning for Face Recognition with Degraded Images
Real-world face recognition systems are sometimes confronted with degraded face images, e.g., low-resolution, blurred, and noisy ones. Traditional two-step methods have limited per...
Bo Li, Hong Chang, Shiguang Shan, Xilin Chen
FLAIRS
2008
15 years 13 days ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan