Sciweavers

104 search results - page 2 / 21
» Incomplete Tree Search using Adaptive Probing
Sort
View
ECAI
2004
Springer
14 years 26 days ago
Local Search for Heuristic Guidance in Tree Search
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next...
Alexander Nareyek, Stephen F. Smith, Christian M. ...
ICDE
2004
IEEE
94views Database» more  ICDE 2004»
14 years 8 months ago
A Probabilistic Approach to Metasearching with Adaptive Probing
An ever increasing amount of valuable information is stored in Web databases, "hidden" behind search interfaces. To save the user's effort in manually exploring eac...
Zhenyu Liu, Chang Luo, Junghoo Cho, Wesley W. Chu
ICMCS
2006
IEEE
227views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Adaptive Dual AK-D Tree Search Algorithm for ICP Registration Applications
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
Jiann-Der Lee, Shih-Sen Hsieh, Chung-Hsien Huang, ...
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 7 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
DASFAA
2007
IEEE
173views Database» more  DASFAA 2007»
14 years 1 months ago
Towards Adaptive Information Merging Using Selected XML Fragments
As XML information proliferates on the Web, searching XML information via a search engine is crucial to the experience of both casual and experienced Web users. The returned XML fr...
Ho Lam Lau, Wilfred Ng