1722 search results - page 294 / 345 » On the sample mean of graphs |
HPCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Automated online search is a powerful technique for performance diagnosis. Such a search can change the types of experiments it performs while the program is running, mak...
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
WCRE
2003
IEEE
15 years 3 months ago
2003
IEEE
As software evolves, maintenance practices require a process of accommodating changing requirements while minimizing the cost of implementing those changes. Over time, incompatibi...
ICMI
2003
Springer
15 years 3 months ago
2003
Springer
Informal presentations are a lightweight means for fast and convenient communication of ideas. People communicate their ideas to others on paper and whiteboards, which afford flui...
DATE
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are ...