Sciweavers

9209 search results - page 36 / 1842
» Data Space Randomization
Sort
View
ICALP
2009
Springer
14 years 10 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
SIGMOD
1999
ACM
181views Database» more  SIGMOD 1999»
14 years 1 months ago
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
Jeffrey Scott Vitter, Min Wang
FLAIRS
2004
13 years 11 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
CAAN
2004
Springer
14 years 3 months ago
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
Anthony Bonato, Jeannette C. M. Janssen
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 1 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko