Sciweavers

2880 search results - page 270 / 576
» Approximate Range Searching
Sort
View
JCDL
2011
ACM
225views Education» more  JCDL 2011»
14 years 6 months ago
How much of the web is archived?
The Memento Project’s archive access additions to HTTP have enabled development of new web archive access user interfaces. After experiencing this web time travel, the inevitabl...
Scott Ainsworth, Ahmed Alsum, Hany SalahEldeen, Mi...
125
Voted
IACR
2011
206views more  IACR 2011»
14 years 3 months ago
Shortest Lattice Vectors in the Presence of Gaps
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
Mingjie Liu, Xiaoyun Wang, Guangwu Xu, Xuexin Zhen...
199
Voted
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 4 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
141
Voted
WWW
2010
ACM
15 years 10 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
134
Voted
FOCS
2008
IEEE
15 years 10 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic