1477 search results - page 170 / 296 » Random Convex Programs |
150
click to vote
DAM
2010
15 years 6 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
158
click to vote
ICALP
2007
Springer
16 years 11 days ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
168
click to vote
ACG
2006
Springer
16 years 6 days ago
2006
Springer
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
177
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
136
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...