Sciweavers

37 search results - page 4 / 8
» Uniformity of Improved Versions of Chord
Sort
View
120
Voted
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 8 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
ISCAS
2008
IEEE
86views Hardware» more  ISCAS 2008»
15 years 8 months ago
Minimum redundancy MIMO radars
—The multiple-input multiple-output (MIMO) radar concept has drawn considerable attention recently. In the traditional single-input multiple-output (SIMO) radar system, the trans...
Chun-Yang Chen, Palghat P. Vaidyanathan
116
Voted
FOCS
1999
IEEE
15 years 6 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 2 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
113
Voted
INFOCOM
2011
IEEE
14 years 5 months ago
Optimal sampling algorithms for frequency estimation in distributed data
—Consider a distributed system with n nodes where each node holds a multiset of items. In this paper, we design sampling algorithms that allow us to estimate the global frequency...
Zengfeng Huang, Ke Yi, Yunhao Liu, Guihai Chen