Sciweavers

7015 search results - page 1051 / 1403
» Approximation algorithms for co-clustering
Sort
View
NIPS
2003
15 years 8 months ago
On the Dynamics of Boosting
In order to understand AdaBoost’s dynamics, especially its ability to maximize margins, we derive an associated simplified nonlinear iterated map and analyze its behavior in lo...
Cynthia Rudin, Ingrid Daubechies, Robert E. Schapi...
VMV
2003
173views Visualization» more  VMV 2003»
15 years 8 months ago
Improved Hardware-Accelerated Visual Hull Rendering
The visual hull is an efficient shape approximation for the purpose of reconstructing and visualizing dynamic objects. Recently, rapid progress in graphics hardware development h...
Ming Li, Marcus A. Magnor, Hans-Peter Seidel
UAI
1998
15 years 8 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
SIROCCO
1997
15 years 8 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
15 years 7 months ago
Recursive least squares and quadratic prediction in continuous multistep problems
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
Daniele Loiacono, Pier Luca Lanzi
« Prev « First page 1051 / 1403 Last » Next »