Sciweavers

2157 search results - page 83 / 432
» Optimal Fast Hashing
Sort
View
152
Voted
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
15 years 9 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
2010
Springer
253views Education» more  CORR 2010»
15 years 4 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
100
Voted
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 4 months ago
Fast GPGPU Data Rearrangement Kernels using CUDA
: Many high performance computing algorithms are bandwidth limited, hence the need for optimal data rearrangement kernels as well as their easy integration into the rest of the app...
Michael Bader, Hans-Joachim Bungartz, Dheevatsa Mu...
TSP
2008
116views more  TSP 2008»
15 years 4 months ago
Fast Blind Separation of Long Mixture Recordings Using Multivariate Polynomial Identification
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...
Johan Thomas, Yannick Deville, Shahram Hosseini
CVPR
2010
IEEE
16 years 9 days ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...