87 search results - page 11 / 18 » Bounds for the generalized repetition threshold |
IPL
2006
14 years 9 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
77
Voted
BC
2005
14 years 9 months ago
2005
We describe a simple but general method to analyze networks of coupled identical nonlinear oscillators, and study applications to fast synchronization, locomotion, and schooling. ...
105
click to vote
COLT
2000
Springer
15 years 2 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
101
Voted
STOC
2012
ACM
13 years 2 days ago
2012
ACM
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we study a maximum likelihood estimation (MLE) approach to preference aggregation and voting when the set of alternatives has a multi-issue structure, and the voter...