Sciweavers

6368 search results - page 1063 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 6 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
AUTOMATICA
2002
81views more  AUTOMATICA 2002»
15 years 6 months ago
The explicit linear quadratic regulator for constrained systems
For discrete-time linear time invariant systems with constraints on inputs and states, we develop an algorithm to determine explicitly, the state feedback control law which minimi...
Alberto Bemporad, Manfred Morari, Vivek Dua, Efstr...
MST
1998
76views more  MST 1998»
15 years 6 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
RAS
2008
127views more  RAS 2008»
15 years 6 months ago
Online generation of cyclic leg trajectories synchronized with sensor measurement
The generation of trajectories for a biped robot is a problem which has been largely studied for several years, and many satisfying off-line solutions exist for steady-state walki...
Rodolphe Héliot, Bernard Espiau
« Prev « First page 1063 / 1274 Last » Next »