Sciweavers

365 search results - page 16 / 73
» Solving the Multiplication Constraint in Several Approximati...
Sort
View
ICRA
2005
IEEE
182views Robotics» more  ICRA 2005»
14 years 1 months ago
Control Synthesis for Dynamic Contact Manipulation
— We explore the control synthesis problem for a robot dynamically manipulating an object in the presence of multiple frictional contacts. Contacts occur both between the object ...
Siddhartha S. Srinivasa, Michael Erdmann, Matthew ...
PRL
2011
13 years 2 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
ICST
2009
IEEE
14 years 2 months ago
PKorat: Parallel Generation of Structurally Complex Test Inputs
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
Junaid Haroon Siddiqui, Sarfraz Khurshid
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 9 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
ICASSP
2011
IEEE
12 years 11 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher