Sciweavers

3652 search results - page 178 / 731
» A study of query length
Sort
View
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
14 years 8 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
IMC
2006
ACM
14 years 2 months ago
Understanding churn in peer-to-peer networks
The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requir...
Daniel Stutzbach, Reza Rejaie
PVLDB
2011
13 years 3 months ago
Hyper-local, directions-based ranking of places
Studies find that at least 20% of web queries have local intent; and the fraction of queries with local intent that originate from mobile properties may be twice as high. The eme...
Petros Venetis, Hector Gonzalez, Christian S. Jens...
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
14 years 2 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
ICALP
2005
Springer
14 years 1 months ago
Optimal In-place Sorting of Vectors and Records
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
Gianni Franceschini, Roberto Grossi