Sciweavers

672 search results - page 104 / 135
» Lower-stretch spanning trees
Sort
View
ISCC
2002
IEEE
14 years 15 days ago
Performance of group communication over ad-hoc networks
We study the performance of reliable and unreliable allnode broadcast over ad-hoc networks that use contentionbased channel access. To obtain analytical results while preserving h...
Marc Mosko, J. J. Garcia-Luna-Aceves
SSD
2001
Springer
113views Database» more  SSD 2001»
14 years 18 hour ago
Object-Relational Indexing for General Interval Relationships
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
GLVLSI
2000
IEEE
113views VLSI» more  GLVLSI 2000»
14 years 8 hour ago
A novel technique for sea of gates global routing
We present a novel global routing and cross-point assignment methodology for sea-of-gates (SOG) designs. Using the proposed congestion driven spanning trees (CDST), and continuous...
Bharat Krishna, C. Y. Roger Chen, Naresh Sehgal
ICNP
1998
IEEE
13 years 12 months ago
Maximizable Routing Metrics
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...
Mohamed G. Gouda, Marco Schneider
ICPP
1998
IEEE
13 years 12 months ago
The Postal Network: A Versatile Interconnection Topology
The postal network is an interconnection network that possesses many desirable properties which are important in network design and applications. It includes hypercubes and Fibona...
Jie Wu, Yuanyuan Yang