2168 search results - page 191 / 434 » Randomized Algorithms and Complexity Theory |
116
Voted
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
107
Voted
JCM
2007
15 years 3 months ago
2007
— This paper deals with the problem of blind carrier-frequency offset (CFO) estimation in OFDM systems based on offset quadrature amplitude modulation (OFDM/OQAM) with null subca...
159
Voted
PODS
2006
ACM
16 years 3 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
122
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
134
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...