Sciweavers

1539 search results - page 14 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
PAMI
2012
11 years 10 months ago
BRIEF: Computing a Local Binary Descriptor Very Fast
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
Michael Calonder, Vincent Lepetit, Mustafa Öz...
FOCM
2002
97views more  FOCM 2002»
13 years 7 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd
ICB
2009
Springer
355views Biometrics» more  ICB 2009»
14 years 2 months ago
3D Signatures for Fast 3D Face Recognition
We propose a vector representation (called a 3D signature) for 3D face shape in biometrics applications. Elements of the vector correspond to fixed surface points in a face-centere...
Chris Boehnen, Tanya Peters, Patrick J. Flynn
ISPA
2004
Springer
14 years 27 days ago
A Scalable Low Discrepancy Point Generator for Parallel Computing
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
Kwong-Ip Liu, Fred J. Hickernell
ECRTS
1999
IEEE
13 years 12 months ago
Timed automaton models for simple programmable logic controllers
We give timed automaton models for a class of Programmable Logic Controller (PLC) applications, that are programmed in a simple fragment of the language Instruction Lists as defin...
Angelika Mader, Hanno Wupper