Sciweavers

1689 search results - page 86 / 338
» Proximate point searching
Sort
View
NECO
2002
117views more  NECO 2002»
15 years 12 days ago
Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
James M. Coughlan, Alan L. Yuille
PAMI
2007
196views more  PAMI 2007»
15 years 7 days ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock
CVGIP
2007
99views more  CVGIP 2007»
15 years 21 days ago
Meshless geometric subdivision
Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with po...
Carsten Moenning, Facundo Mémoli, Guillermo...
3DIM
2003
IEEE
15 years 4 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
121
Voted
DEXAW
2010
IEEE
181views Database» more  DEXAW 2010»
15 years 1 months ago
Towards a Search System for the Web Exploiting Spatial Data of a Web Document
In this paper, we describe our work in progress in the scope of information retrieval exploiting the spatial data extracted from web documents. We discuss problems of a search for ...
Stefan Dlugolinsky, Michal Laclavik, Ladislav Hluc...