Sciweavers

123 search results - page 19 / 25
» Robust binary least squares: Relaxations and algorithms
Sort
View
ICRA
2008
IEEE
158views Robotics» more  ICRA 2008»
14 years 3 months ago
Inverse Kinematics without matrix inversion
– This paper presents a new singularity robust and computationally efficient method for solving the inverse kinematics (IK) problem. In this method, the transformation from Carte...
Alexandre N. Pechev
ICIAR
2005
Springer
14 years 2 months ago
Marrying Level Lines for Stereo or Motion
Efficient matching methods are crucial in Image Processing. In the present paper we outline a novel algorithm of ”stable marriages” that is also fair and globally satisfactory ...
Nikom Suvonvorn, Samia Bouchafa, Bertrand Zavidovi...
MVA
1996
129views Computer Vision» more  MVA 1996»
13 years 9 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
VTC
2007
IEEE
126views Communications» more  VTC 2007»
14 years 2 months ago
Symmetric Radial Basis Function Assisted Space-Time Equalisation for Multiple Receive-Antenna Aided Systems
— This constribution considers nonlinear space-time equalisation (STE) designed for single-input multiple-output (SIMO) systems. By exploiting the inherent symmetry of the underl...
Lajos Hanzo, Sheng Chen, S. Liu
SDM
2010
SIAM
204views Data Mining» more  SDM 2010»
13 years 10 months ago
Scalable Tensor Factorizations with Missing Data
The problem of missing data is ubiquitous in domains such as biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer...
Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda, Mo...