Sciweavers

3020 search results - page 363 / 604
» Optimal partition trees
Sort
View
SC
2005
ACM
16 years 4 days ago
Balanced Multicasting: High-throughput Communication for Grid Applications
Many grid applications need to transfer large amounts of data between the geographically distributed sites of a grid environment. Network heterogeneity between these sites makes t...
Mathijs den Burger, Thilo Kielmann, Henri E. Bal
WOWMOM
2005
ACM
113views Multimedia» more  WOWMOM 2005»
16 years 4 days ago
High Throughput Routing in Hybrid Cellular and Ad-Hoc Networks
—Hybrid networks are a promising architecture that builds ad hoc, wireless networks around the existing cellular telephony infrastructure. In this paper we present DST, a routing...
Ioannis Ioannidis, Bogdan Carbunar, Cristina Nita-...
IPPS
2003
IEEE
15 years 12 months ago
Channel Assignment on Strongly-Simplicial Graphs
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
DATE
2002
IEEE
104views Hardware» more  DATE 2002»
15 years 11 months ago
Closed-Form Crosstalk Noise Metrics for Physical Design Applications
In this paper we present efficient closed-form formulas to estimate capacitive coupling-induced crosstalk noise for distributed RC coupling trees. The efficiency of our approach...
Lauren Hui Chen, Malgorzata Marek-Sadowska
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 10 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig