Sciweavers

808 search results - page 144 / 162
» On the Estimation of Join Result Sizes
Sort
View
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
12 years 21 days ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
DL
2000
Springer
137views Digital Library» more  DL 2000»
14 years 2 months ago
Server selection on the World Wide Web
We evaluate server selection methods in a Web environment, modeling a digital library which makes use of existing Web search servers rather than building its own index. The evalua...
Nick Craswell, Peter Bailey, David Hawking
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
14 years 4 months ago
How to scalably and accurately skip past streams
Data stream methods look at each new item of the stream, perform a small number of operations while keeping a small amount of memory, and still perform muchneeded analyses. Howeve...
Supratik Bhattacharyya, André Madeira, S. M...
ISCAS
2006
IEEE
90views Hardware» more  ISCAS 2006»
14 years 4 months ago
Phase measurement and adjustment of digital signals using random sampling technique
—This paper introduces a technique to measure and adjust the relative phase of on-chip high speed digital signals using a random sampling technique of inferential statistics. The...
Rashed Zafar Bhatti, Monty Denneau, Jeff Draper
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 3 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun