2125 search results - page 408 / 425 » On Graph Complexity |
SIGCOMM
2004
ACM
14 years 28 days ago
2004
ACM
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
EMSOFT
2004
Springer
14 years 27 days ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
ISMIR
2004
Springer
14 years 26 days ago
2004
Springer
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...
OOPSLA
2004
Springer
14 years 25 days ago
2004
Springer
Java workloads are becoming more and more prominent on various computing devices. Understanding the behavior of a Java workload which includes the interaction between the applicat...
TACAS
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...