124 search results - page 8 / 25 » Using Available Memory to Transform Graphplan's Search |
101
Voted
CVPR
2009
IEEE
16 years 2 months ago
2009
IEEE
We propose a new approach for detecting low textured
planar objects and estimating their 3D pose. Standard
matching and pose estimation techniques often depend on
texture and fe...
FSE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
UAI
1997
14 years 11 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
COMAD
2009
14 years 11 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
102
click to vote
ICVGIP
2004
14 years 11 months ago
2004
Searching in scanned documents is an important problem in Digital Libraries. If OCRs are not available, the scanned images are inaccessible. In this paper, we demonstrate a search...