Sciweavers

3708 search results - page 74 / 742
» Approximating Betweenness Centrality
Sort
View
112
Voted
TASLP
2008
133views more  TASLP 2008»
15 years 14 days ago
Adaptive System Identification in the Short-Time Fourier Transform Domain Using Cross-Multiplicative Transfer Function Approxima
In this paper, we introduce cross-multiplicative transfer function (CMTF) approximation for modeling linear systems in the short-time Fourier transform (STFT) domain. We assume tha...
Yekutiel Avargel, Israel Cohen
100
Voted
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
15 years 6 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
90
Voted
SIBGRAPI
2003
IEEE
15 years 5 months ago
An Approximation for Normal Vectors of Deformable Models
A physically-based deformable model proposed by Terzopoulous et al. is governed by the Lagrange’s form, that establishes the relation between the dynamics of deformable models un...
Shin-Ting Wu, Vanio Fragoso de Melo
ICASSP
2010
IEEE
15 years 23 days ago
Approximate nearest neighbors using sparse representations
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
Joaquin Zepeda, Ewa Kijak, Christine Guillemot
IJON
2008
106views more  IJON 2008»
15 years 17 days ago
Approximation to the Fisher-Rao metric for the focus of expansion
The Fisher-Rao metric for the focus of expansion is approximated, under the assumption that the focus is estimated from correspondences between two images taken by a translating ca...
Stephen J. Maybank