4850 search results - page 334 / 970 » Approximate Data Structures with Applications |
174
click to vote
LCN
2008
IEEE
16 years 1 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
181
click to vote
SOFSEM
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. After text retrieval, the next waves in web searching and multimedia retrieval are the search for and delivery of images, music, video, and 3D scenes. Not only the percep...
141
click to vote
ICCD
1991
IEEE
15 years 10 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
149
click to vote
UAI
2004
15 years 8 months ago
2004
We present a new method for nonlinear prediction of discrete random sequences under minimal structural assumptions. We give a mathematical construction for optimal predictors of s...
150
click to vote
SDB
1995
15 years 10 months ago
1995
In this paper we discuss two data models for spatial database systems: the linear data model and the topological data model. Both can be used to model a wide range of applications....