Sciweavers

3208 search results - page 240 / 642
» A Lower Bound for Primality
Sort
View
SIGMOD
2003
ACM
142views Database» more  SIGMOD 2003»
16 years 6 months ago
Winnowing: Local Algorithms for Document Fingerprinting
Digital content is for copying: quotation, revision, plagiarism, and file sharing all create copies. Document fingerprinting is concerned with accurately identifying copying, incl...
Saul Schleimer, Daniel Shawcross Wilkerson, Alexan...
FOCS
2008
IEEE
16 years 1 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
Michael Ben-Or, Avinatan Hassidim
ICDCS
2008
IEEE
16 years 1 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
GLOBECOM
2007
IEEE
16 years 29 days ago
Iterative Channel Estimation for IDMA Systems in Time-Varying Channels
— In this paper, we develop low-complexity iterative channel estimation techniques for emerging IDMA systems. The channel estimators make use of pilots as well as soft decoded da...
Xiangyun Zhou, Zhenning Shi, Mark C. Reed
FSTTCS
2004
Springer
16 years 5 hour ago
Testing Geometric Convexity
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...
Luis Rademacher, Santosh Vempala