944 search results - page 91 / 189 » Heuristic Search for Large Problems With Real Costs |
SIGMOD
2012
ACM
13 years 16 days ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
ICDE
2010
IEEE
15 years 5 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
TSP
2010
14 years 4 months ago
2010
Abstract--This paper deals with the reconstruction of T1-T2 correlation spectra in nuclear magnetic resonance relaxometry. The ill-posed character and the large size of this invers...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
CVPR
1998
IEEE
16 years 3 days ago
1998
IEEE
The problem considered in this paper is that of estimating the projective transformation between two images in situations where the image motion is large and featurematching is no...