Sciweavers

3708 search results - page 700 / 742
» Approximating Betweenness Centrality
Sort
View
INFOCOM
2003
IEEE
14 years 3 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
SAC
2003
ACM
14 years 3 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
SASN
2003
ACM
14 years 3 months ago
Location-based pairwise key establishments for static sensor networks
Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversar...
Donggang Liu, Peng Ning
SENSYS
2003
ACM
14 years 3 months ago
SIA: secure information aggregation in sensor networks
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
Bartosz Przydatek, Dawn Xiaodong Song, Adrian Perr...
SI3D
2003
ACM
14 years 3 months ago
Interruptible rendering
Interruptible rendering is a novel approach to the fidelity-versusperformance tradeoff ubiquitous in real-time rendering. Interruptible rendering unifies spatial error, caused by ...
Cliff Woolley, David P. Luebke, Benjamin Watson, A...