Sciweavers

166 search results - page 22 / 34
» A fast distributed approximation algorithm for minimum spann...
Sort
View
152
Voted
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 8 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
CISS
2007
IEEE
15 years 6 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
149
Voted
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 9 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
IPPS
1998
IEEE
15 years 6 months ago
Multicasting and Broadcasting in Large WDM Networks
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
Weifa Liang, Hong Shen
IPPS
2002
IEEE
15 years 7 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna