Sciweavers

2157 search results - page 269 / 432
» Optimal Fast Hashing
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 8 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
131
Voted
SPAA
2003
ACM
15 years 8 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
106
Voted
ALGORITHMICA
2010
153views more  ALGORITHMICA 2010»
15 years 3 months ago
Confluently Persistent Tries for Efficient Version Control
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
Erik D. Demaine, Stefan Langerman, Eric Price
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
15 years 3 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
TASLP
2008
176views more  TASLP 2008»
15 years 3 months ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney