Sciweavers

779 search results - page 59 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
3DIM
2003
IEEE
13 years 11 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
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 1 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
WCE
2007
13 years 8 months ago
An Intelligent Conversational Agent Approach to Extracting Queries from Natural Language
—This paper is concerned with the application of a conversational agent and expert system to provide a natural language interface to a database. Typically, natural language datab...
Karen Pudner, Keeley A. Crockett, Zuhair Bandar
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 9 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
CEAS
2005
Springer
14 years 1 months ago
Implicit Queries for Email
Implicit query systems examine a document and automatically conduct searches for the most relevant information. In this paper, we offer three contributions to implicit query resea...
Joshua Goodman, Vitor R. Carvalho