Sciweavers

6365 search results - page 190 / 1273
» Fast Local Computation Algorithms
Sort
View
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
15 years 10 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Erich Kaltofen, Victor Shoup
JCPHY
2011
109views more  JCPHY 2011»
14 years 9 months ago
Fast construction of hierarchical matrix representation from matrix-vector multiplication
We develop a hierarchical matrix construction algorithm using matrixvector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorith...
Lin Lin, Jianfeng Lu, Lexing Ying
ROBIO
2006
IEEE
172views Robotics» more  ROBIO 2006»
16 years 7 days ago
Robust 3D Robotic Sound Localization Using State-Space HRTF Inversion
Abstract— We address the problem of robotic real-time binaural hearing using a humanoid head. The sound detection ability for a previously proposed robotic 3D binaural sound loca...
Fakheredine Keyrouz, Klaus Diepold, Patrick Dewild...
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Fast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
Lélia Blin, Shlomi Dolev, Maria Potop-Butuc...
IJCAI
2007
15 years 7 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert