Sciweavers

906 search results - page 175 / 182
» Matching Subsequences in Trees
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
FOCS
2008
IEEE
14 years 2 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...
HPDC
2007
IEEE
14 years 1 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 1 months ago
Utility-Aware Resource Allocation for Multi-Stream Overlay Multicast
Abstract - Overlay multicast, which performs topology construction and data relaying in the application layer, has recently emerged as a promising vehicle for data distribution. In...
Ji Xu, Jiangchuan Liu, Hsiao-Hwa Chen, Xiao Chu
ICNP
2007
IEEE
14 years 1 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...