Sciweavers

1810 search results - page 358 / 362
» Type Systems for Distributed Data Structures
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
MOBICOM
2006
ACM
14 years 1 months ago
Boundary recognition in sensor networks by topological methods
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
Yue Wang, Jie Gao, Joseph S. B. Mitchell
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 25 days ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
VLDB
2001
ACM
94views Database» more  VLDB 2001»
13 years 12 months ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
VLDB
1987
ACM
92views Database» more  VLDB 1987»
13 years 11 months ago
Mind Your Grammar: a New Approach to Modelling Text
Beginning to create the New Oxford English Dictionary database has resulted in the realization that databases for reference texts are unlike those for conventional enterprises. Wh...
Gaston H. Gonnet, Frank Wm. Tompa