3875 search results - page 349 / 775 » Approximation algorithms for the 0-extension problem |
178
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
207
click to vote
TSP
2008
15 years 6 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...
216
click to vote
CVPR
2010
IEEE
16 years 2 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...
187
click to vote
NIPS
2004
15 years 8 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...
205
click to vote
ICRA
2008
IEEE
16 years 1 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...