Sciweavers

2252 search results - page 407 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
INFORMATICALT
2007
97views more  INFORMATICALT 2007»
13 years 8 months ago
Fabric Level and Application Level QoS Guarantees in Grid Computing
In the paper, a cross-layer optimization between application layer and fabric layer is proposed. The aim is to optimize the end-to-end quality of the dynamic grid application as we...
Li Chunlin, Li Layuan
IJRR
2011
126views more  IJRR 2011»
13 years 3 months ago
Optimization and learning for rough terrain legged locomotion
We present a novel approach to legged locomotion over rough terrain that is thoroughly rooted in optimization. This approach relies on a hierarchy of fast, anytime algorithms to p...
Matthew Zucker, Nathan D. Ratliff, Martin Stolle, ...
JMLR
2010
115views more  JMLR 2010»
13 years 3 months ago
O-IPCAC and its Application to EEG Classification
In this paper we describe an online/incremental linear binary classifier based on an interesting approach to estimate the Fisher subspace. The proposed method allows to deal with ...
Alessandro Rozza, Gabriele Lombardi, Marco Rosa, E...
MMAS
2010
Springer
13 years 3 months ago
A Nonlinear PDE-Based Method for Sparse Deconvolution
In this paper, we introduce a new nonlinear evolution partial differential equation for sparse deconvolution problems. The proposed PDE has the form of continuity equation that ar...
Yu Mao, Bin Dong, Stanley Osher
ICASSP
2011
IEEE
13 years 16 days ago
Exploiting sparseness of backing-off language models for efficient look-ahead in LVCSR
In this paper, we propose a new method for computing and applying language model look-ahead in a dynamic network decoder, exploiting the sparseness of backing-off n-gram language ...
David Nolden, Hermann Ney, Ralf Schlüter