551 search results - page 16 / 111 » The Complexity of Andersen's Analysis in Practice |
ALGORITHMICA
2000
13 years 6 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
ICC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
ISSAC
2004
Springer
14 years 3 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...
ISSAC
1997
Springer
13 years 11 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...
DIAU
2000
Springer
13 years 10 months ago
2000
Springer
We present the traffic analysis problem and expose the most important protocols, attacks and design issues. Afterwards, we propose directions for further research. As we are mostl...