3874 search results - page 319 / 775 » Approximation Algorithms for k-hurdle Problems |
158
click to vote
TSP
2008
15 years 4 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
159
click to vote
CVPR
2012
IEEE
13 years 7 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...
168
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
149
click to vote
NIPS
2004
15 years 6 months ago
2004
We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchi...
167
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
— The lack of a parameterized observation model in robot localization using occupancy grids requires the application of sampling-based methods, or particle filters. This work ad...