417 search results - page 26 / 84 » Some Theory for Generalized Boosting Algorithms |
147
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
JSC
2010
14 years 10 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
102
click to vote
DOLAP
2000
ACM
15 years 4 months ago
2000
ACM
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
138
click to vote
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...