39 search results - page 5 / 8 » Algorithms for Finding Maximal-Scoring Segment Sets (Extende... |
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. We propose a probabalistic model of single source multimodal generation and show how algorithms for maximizing mutual information can find the correspondences between com...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Automatic delineation of anatomical structures in 3-D volumetric data is a challenging task due to the complexity of the object appearance as well as the quantity of info...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...