Sciweavers

304 search results - page 18 / 61
» Solving Generalized Small Inverse Problems
Sort
View
SIAMMAX
2010
189views more  SIAMMAX 2010»
13 years 2 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
JCO
2010
101views more  JCO 2010»
13 years 6 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
IROS
2008
IEEE
122views Robotics» more  IROS 2008»
14 years 2 months ago
A probabilistic Programming by Demonstration framework handling constraints in joint space and task space
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...
Sylvain Calinon, Aude Billard
HAPTICS
2007
IEEE
14 years 2 months ago
Transparent Rendering of Tool Contact with Compliant Environments
Transparent haptic rendering of the contact between a tool and its environment requires very frequent update of the contact forces acting on the tool. Given a rigid tool and a def...
Miguel A. Otaduy, Markus H. Gross
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 8 days ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom