Sciweavers

1337 search results - page 83 / 268
» Fast computation of distance estimators
Sort
View
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 8 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
JCM
2008
76views more  JCM 2008»
13 years 9 months ago
Waterfilling Estimation for AWGN MIMO Channel Modeled as a Random Matrix
Waterfilling solutions provide optimal power distribution in multiple-input multiple-output (MIMO) system design. However, the optimal distribution is usually obtained through cost...
Victor M. Vergara, Silvio E. Barbin, Ramiro Jordan
JMIV
2002
72views more  JMIV 2002»
13 years 9 months ago
Estimating Overcomplete Independent Component Bases for Image Windows
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
Aapo Hyvärinen, Mika Inki
ICPR
2008
IEEE
14 years 4 months ago
Markerless human motion capture: An application of simulated annealing and Fast Marching Method
Research into optical markerless human motion capture has attracted significant attention. However, the complexity of the human anatomy, ambiguities introduced by lacking full-pe...
Yifan Lu
JMLR
2010
186views more  JMLR 2010»
13 years 4 months ago
Dimensionality Estimation, Manifold Learning and Function Approximation using Tensor Voting
We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under...
Philippos Mordohai, Gérard G. Medioni