2034 search results - page 304 / 407 » On the Comparability of Software Clustering Algorithms |
GLVLSI
2007
IEEE
14 years 2 months ago
2007
IEEE
We describe an efficient, top-down strategy for overlap removal and floorplan repair which repairs overlaps in floorplans produced by placement algorithms or rough floorplanni...
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
PPOPP
2006
ACM
14 years 2 months ago
2006
ACM
Traditional collective communication algorithms are designed with the assumption that a node can communicate with only one other node at a time. On new parallel architectures such...
ICALT
2005
IEEE
14 years 1 months ago
2005
IEEE
The ability to provide assistance for a student at the appropriate level is invaluable in the learning process. Not only does it aid the student’s learning process but also prev...
ISSAC
2004
Springer
14 years 1 months 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...