126 search results - page 22 / 26 » Storing a Compressed Function with Constant Time Access |
COCOON
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
SIAMSC
2008
13 years 7 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
MOBIHOC
2003
ACM
14 years 7 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
IOT
2010
13 years 5 months ago
2010
Abstract--1D or linear barcodes are the black-and-whitestriped codes that can be found on most consumer products. This work evaluates existing 1D barcode scanners for mobile phones...