Sciweavers

3630 search results - page 381 / 726
» Fast Marching Methods
Sort
View
132
Voted
JMIV
2002
72views more  JMIV 2002»
15 years 4 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
163
Voted
PE
2007
Springer
131views Optimization» more  PE 2007»
15 years 4 months ago
Moment estimation in delay tomography with spatial dependence
Parametric models for estimating network link delays with incomplete data that incorporate spatial correlation are formulated. Fast numerical methods for estimation of parameters ...
Ian H. Dinwoodie, Eric A. Vance
ICRA
2010
IEEE
117views Robotics» more  ICRA 2010»
15 years 3 months ago
Online intention recognition for computer-assisted teleoperation
— An online intention recognition algorithm for computer-assisted teleoperation is introduced. The algorithm is able to distinguish between phases of a typical object manipulatio...
Nikolay Stefanov, Angelika Peer, Martin Buss
130
Voted
CAP
2010
14 years 12 months ago
A high-performance algorithm for calculating cyclotomic polynomials
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
Andrew Arnold, Michael B. Monagan
JCAM
2010
84views more  JCAM 2010»
14 years 11 months ago
Transfinite mean value interpolation in general dimension
Mean value interpolation is a simple, fast, linearly precise method of smoothly interpolating a function given on the boundary of a domain. For planar domains, several properties ...
Solveig Bruvoll, Michael S. Floater