736 search results - page 117 / 148 » A dynamic data structure for approximate range searching |
ICDAR
2011
IEEE
12 years 8 months ago
2011
IEEE
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
SCALESPACE
2001
Springer
14 years 1 months ago
2001
Springer
This paper develops and investigates a new approach for evaluating feature based object hypotheses in a direct way. The idea is to compute a feature likelihood map (FLM), which is ...
TVLSI
2008
13 years 8 months ago
2008
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
CVPR
1998
IEEE
14 years 10 months ago
1998
IEEE
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
SRDS
2003
IEEE
14 years 1 months ago
2003
IEEE
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a general...