5595 search results - page 845 / 1119 » Approximation Algorithms for Clustering Problems |
180
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
174
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
170
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
215
click to vote
NIPS
2008
15 years 8 months ago
2008
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
180
click to vote
MMNS
2003
15 years 8 months ago
2003
Abstract. We introduce a new measurement algorithm for the available bandwidth in a network path between two endhosts. This algorithm is an adaptation from existing active measurem...