Sciweavers

249 search results - page 42 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
CDES
2006
99views Hardware» more  CDES 2006»
13 years 10 months ago
Teraflop Computing for Nanoscience
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
Yang Wang 0008, G. M. Stocks, Aurelian Rusanu, D. ...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
PIMRC
2010
IEEE
13 years 7 months ago
Fast varying channel estimation in downlink LTE systems
This paper tackles the problem of fast varying channel estimation in LTE systems. Particular attention is given to downlink transmission where OFDMA is used as the multiple access ...
Youssef El Hajj Shehadeh, Serdar Sezginer
FOCS
1991
IEEE
14 years 17 days ago
A General Approach to Removing Degeneracies
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
Ioannis Z. Emiris, John F. Canny
CERA
2002
134views more  CERA 2002»
13 years 9 months ago
Design Parameterization for Concurrent Design and Manufacturing of Mechanical Systems
Design changes are frequently encountered in the product development process. The complexity of the design changes is multiplied when the product design involves multiple engineer...
Javier Silva, Kuang-Hua Chang