4114 search results - page 382 / 823 » Efficient Algorithms for the 2-Center Problems |
173
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
The 2.1D sketch is a layered representation of occluding and occluded surfaces of the scene. Extracting the 2.1D sketch from a single image is a difficult and important problem ar...
187
Voted
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Although Support Vector Machines(SVM) succeed in classifying several image databases using image descriptors proposed in the literature, no single descriptor can be optimal for ge...
280
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
151
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
301
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...