1425 search results - page 123 / 285 » Beyond Dependency Graphs |
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns....
ISPASS
2006
IEEE
14 years 2 months ago
2006
IEEE
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in so...
CSMR
2000
IEEE
14 years 20 days ago
2000
IEEE
Shimba, a prototype reverse engineering environment, has been built to support the understanding of Java software. Shimba uses Rigi and SCED to analyze, visualize, and explore the...