10890 search results - page 315 / 2178 » Automatic Complexity Analysis |
174
click to vote
IPSN
2004
Springer
16 years 12 hour ago
2004
Springer
The performance of a sensor network may be best judged by the quality of application specific information return. The actual sensing performance of a deployed sensor network depe...
149
click to vote
ISSAC
2004
Springer
16 years 10 hour 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...
199
click to vote
ICISP
2010
Springer
15 years 11 months ago
2010
Springer
High-resolution nuclear magnetic resonance (NMR) spectra contain important biomarkers that have potentials for early diagnosis of disease and subsequent monitoring of its progressi...
142
click to vote
ISCA
1997
IEEE
15 years 11 months ago
1997
IEEE
The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, ...
264
click to vote
ISSAC
1997
Springer
15 years 10 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...