308 search results - page 55 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
104
click to vote
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
103
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...