Sciweavers

16666 search results - page 340 / 3334
» Descriptive and Computational Complexity
Sort
View
ICS
2009
Tsinghua U.
16 years 1 months ago
Adagio: making DVS practical for complex HPC applications
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...
Barry Rountree, David K. Lowenthal, Bronis R. de S...
ICASSP
2009
IEEE
16 years 1 months ago
Fast noise PSD estimation with low complexity
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 ...
Richard C. Hendriks, Richard Heusdens, Jesper Jens...
ISCAS
2007
IEEE
152views Hardware» more  ISCAS 2007»
16 years 1 months ago
Reduced Complexity Space-Time-Frequency Model for Multi-Channel EEG and Its Applications
— Searching for an efficient summarization of multi-channel electroencephalogram (EEG) behavior is a challenging signal analysis problem. Recently, parallel factor analysis (PAR...
Yodchanan Wongsawat, Soontorn Oraintara, K. R. Rao
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
16 years 3 days ago
Complexity issues in bivariate polynomial factorization
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...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...
SI3D
2003
ACM
16 years 3 hour ago
Interactive navigation in complex environments using path planning
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...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...