Sciweavers

1681 search results - page 187 / 337
» Speeding up keyword search for search engines
Sort
View
EDBT
2008
ACM
166views Database» more  EDBT 2008»
16 years 1 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
CRV
2008
IEEE
165views Robotics» more  CRV 2008»
15 years 8 months ago
Hierarchical Stereo with Thin Structures and Transparency
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
Mikhail Sizintsev
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
15 years 8 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
15 years 6 months ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
Timothée Jost, Heinz Hügli
AIPS
2000
15 years 3 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau