Sciweavers

1402 search results - page 70 / 281
» Sparse-Memory Graph Search
Sort
View
EDBT
2006
ACM
159views Database» more  EDBT 2006»
15 years 10 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
CVPR
2007
IEEE
15 years 4 months ago
Single View Human Action Recognition using Key Pose Matching and Viterbi Path Searching
3D human pose recovery is considered as a fundamental step in view-invariant human action recognition. However, inferring 3D poses from a single view usually is slow due to the la...
Fengjun Lv, Ramakant Nevatia
QSHINE
2005
IEEE
15 years 3 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
ECAI
2004
Springer
15 years 3 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
Kenneth N. Brown, James Little, Páidí...
JAR
2000
90views more  JAR 2000»
14 years 9 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter