41 search results - page 6 / 9 » Efficient Approximate Visibility Query in Large Dynamic Envi... |
DBISP2P
2006
Springer
13 years 11 months ago
2006
Springer
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructur...
ALGOSENSORS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
ACCV
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very...
ECCV
2010
Springer
14 years 28 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
VLDB
2005
ACM
14 years 8 months ago
2005
ACM
With the recent advances in wireless networks, embedded systems and GPS technology, databases that manage the location of moving objects have received increased interest. In this ...