Sciweavers

199 search results - page 17 / 40
» Computationally and Algebraically Complex Finite Algebra Mem...
Sort
View
CSR
2007
Springer
14 years 2 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
ICCAD
2006
IEEE
149views Hardware» more  ICCAD 2006»
14 years 2 months ago
Fast decap allocation based on algebraic multigrid
Decap (decoupling capacitor) is an effective technique for suppressing power supply noise. Nevertheless, over-usage of decap usually causes excessive power dissipation. Therefore...
Cheng Zhuo, Jiang Hu, Min Zhao, Kangsheng Chen
ML
2000
ACM
103views Machine Learning» more  ML 2000»
13 years 8 months ago
Nonparametric Time Series Prediction Through Adaptive Model Selection
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
Ron Meir
DAC
1994
ACM
14 years 3 days ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
AML
2008
124views more  AML 2008»
13 years 8 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian