Sciweavers

1429 search results - page 135 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
COMPUTING
2006
119views more  COMPUTING 2006»
13 years 9 months ago
Sparse Grids, Adaptivity, and Symmetry
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
Harry Yserentant
TWC
2010
13 years 3 months ago
On the distribution of instantaneous power in single-carrier signals
Abstract-- This paper studies a statistical distribution of instantaneous power in pulse-shaped single-carrier (SC) modulation. Such knowledge is of significant importance to estim...
Makoto Tanahashi, Hideki Ochiai
IROS
2006
IEEE
135views Robotics» more  IROS 2006»
14 years 3 months ago
Toward Legless Locomotion Control
— Motivated by an error-recovery locomotion problem, we propose a control technique for a complex mechanical system by decomposing the system dynamics into a collection of simpli...
Ravi Balasubramanian, Alfred A. Rizzi, Matthew T. ...
NIPS
1994
13 years 10 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad
ECCC
2006
109views more  ECCC 2006»
13 years 9 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy