1450 search results - page 126 / 290 » On the Complexity of Hardness Amplification |
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
ISSRE
2010
IEEE
13 years 7 months ago
2010
IEEE
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
FPGA
2011
ACM
13 years 20 days ago
2011
ACM
As soft processors are increasingly used in diverse applications, there is a need to evolve their microarchitectures in a way that suits the FPGA implementation substrate. This pa...
AI
2008
Springer
13 years 9 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
In this paper we present a method for learning a curve model for detection and segmentation by closely integrating a hierarchical curve representation using generative and discrim...