10054 search results - page 1800 / 2011 » On the Complexity of Function Learning |
257
Voted
STACS
2012
Springer
14 years 2 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
181
click to vote
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Hough voting methods efficiently handle the high complexity of multiscale,
category-level object detection in cluttered scenes. The primary weakness
of this approach is however t...
200
Voted
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
222
Voted
TVCG
2012
13 years 9 months ago
2012
—In this paper, we present a robust and accurate algorithm for interactive image segmentation. The level set method is clearly advantageous for image objects with a complex topol...
192
click to vote
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...