13603 search results - page 332 / 2721 » On the Computational Complexity of Cut-Reduction |
196
Voted
ICS
2009
Tsinghua U.
16 years 2 months ago
2009
Tsinghua U.
Power and energy are first-order design constraints in high performance computing. Current research using dynamic voltage scaling (DVS) relies on trading increased execution time...
198
Voted
ICASSP
2009
IEEE
16 years 2 months ago
2009
IEEE
Although noise PSD estimation is a crucial part of noise reduction algorithms, most noise PSD estimators have problems in tracking non-stationary noise sources. Recently, a noise ...
195
Voted
ISCAS
2007
IEEE
16 years 1 months ago
2007
IEEE
— Searching for an efficient summarization of multi-channel electroencephalogram (EEG) behavior is a challenging signal analysis problem. Recently, parallel factor analysis (PAR...
168
Voted
ISSAC
2004
Springer
16 years 25 days ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
212
click to vote
SI3D
2003
ACM
16 years 21 days ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...