Sciweavers

1523 search results - page 122 / 305
» The Computational Complexity of Linear Optics
Sort
View
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
14 years 3 months ago
Fast Implementation of Lemke's Algorithm for Rigid Body Contact Simulation
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
John E. Lloyd
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 10 months ago
Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
David Soloveichik
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 9 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
FOCS
1994
IEEE
14 years 2 months ago
Expander Codes
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
Michael Sipser, Daniel A. Spielman
CORR
2010
Springer
210views Education» more  CORR 2010»
13 years 5 months ago
Classification with Scattering Operators
A scattering vector is a local descriptor including multiscale and multi-direction co-occurrence information. It is computed with a cascade of wavelet decompositions and complex m...
Joan Bruna, Stéphane Mallat