Sciweavers

139 search results - page 10 / 28
» Bandwidth on AT-Free Graphs
Sort
View
IM
2007
13 years 10 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
GD
2008
Springer
13 years 11 months ago
Succinct Greedy Graph Drawing in the Hyperbolic Plane
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
David Eppstein, Michael T. Goodrich
NETWORKING
2007
13 years 11 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
BROADNETS
2005
IEEE
14 years 4 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
MICRO
2006
IEEE
100views Hardware» more  MICRO 2006»
14 years 4 months ago
Serialization-Aware Mini-Graphs: Performance with Fewer Resources
Instruction aggregation—the grouping of multiple operations into a single processing unit—is a technique that has recently been used to amplify the bandwidth and capacity of c...
Anne Bracy, Amir Roth