Sciweavers

2503 search results - page 379 / 501
» A study of 3-arc graphs
Sort
View
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
13 years 8 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
TON
2010
158views more  TON 2010»
13 years 8 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
TVCG
2010
142views more  TVCG 2010»
13 years 8 months ago
SparkClouds: Visualizing Trends in Tag Clouds
—Tag clouds have proliferated over the web over the last decade. They provide a visual summary of a collection of texts by visually depicting the tag frequency by font size. In u...
Bongshin Lee, Nathalie Henry Riche, Amy K. Karlson...
INFOCOM
2010
IEEE
13 years 8 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
IPPS
2010
IEEE
13 years 8 months ago
Tile QR factorization with parallel panel processing for multicore architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
Bilel Hadri, Hatem Ltaief, Emmanuel Agullo, Jack D...