60 search results - page 3 / 12 » Dispersion of Mass and the Complexity of Randomized Geometri... |
JCM
2007
13 years 5 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...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
ICDIM
2007
IEEE
13 years 11 months ago
2007
IEEE
: A new video watermarking algorithm for access control is introduced. This method is content-dependent and uses the dual tree complex wavelet transform (DT CWT) to create a waterm...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...