154 search results - page 14 / 31 » On Boosting with Polynomially Bounded Distributions |
82
Voted
ESA
2004
Springer
15 years 2 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
104
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
ATAL
2004
Springer
15 years 2 months ago
2004
Springer
As of today no solely software-based solution that a priori protects the computation of any mobile code and/or mobile agent was presented. Furthermore, Algesheimer et al. [1], arg...