Sciweavers

620 search results - page 32 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
ICRA
2010
IEEE
107views Robotics» more  ICRA 2010»
15 years 15 days ago
Fast resolution of hierarchized inverse kinematics with inequality constraints
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
Adrien Escande, Nicolas Mansard, Pierre-Brice Wieb...
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 9 months ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König
ICDAR
2003
IEEE
15 years 7 months ago
Fast Lexicon-Based Word Recognition in Noisy Index Card Images
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
Simon M. Lucas, Gregory Patoulas, Andy C. Downton
WDAG
2010
Springer
184views Algorithms» more  WDAG 2010»
15 years 10 days ago
Fast Asynchronous Consensus with Optimal Resilience
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Mal...
IJCAI
2007
15 years 3 months ago
Kernel Conjugate Gradient for Fast Kernel Machines
We propose a novel variant of the conjugate gradient algorithm, Kernel Conjugate Gradient (KCG), designed to speed up learning for kernel machines with differentiable loss functio...
Nathan D. Ratliff, J. Andrew Bagnell