Sciweavers

1493 search results - page 200 / 299
» Local resilience of graphs
Sort
View
OOPSLA
1999
Springer
14 years 12 days ago
Compositional Pointer and Escape Analysis for Java Programs
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
John Whaley, Martin C. Rinard
IPPS
2000
IEEE
13 years 11 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
ICCAD
1995
IEEE
113views Hardware» more  ICCAD 1995»
13 years 11 months ago
Logic decomposition during technology mapping
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
Eric Lehman, Yosinori Watanabe, Joel Grodstein, He...
ICPP
1991
IEEE
13 years 11 months ago
Emulation of a PRAM on Leveled Networks
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
Michael A. Palis, Sanguthevar Rajasekaran, David S...
AUSAI
2008
Springer
13 years 10 months ago
Learning a Generative Model for Structural Representations
Abstract. Graph-based representations have been used with considercess in computer vision in the abstraction and recognition of object shape and scene structure. Despite this, the ...
Andrea Torsello, David L. Dowe