Sciweavers

1536 search results - page 74 / 308
» Approximately Dominating Representatives
Sort
View
HPDC
2006
IEEE
15 years 10 months ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter
ICALP
2001
Springer
15 years 9 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
OPODIS
2007
15 years 5 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
INFOCOM
2012
IEEE
13 years 6 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
MMB
2004
Springer
116views Communications» more  MMB 2004»
15 years 9 months ago
Availability Assessment of Resilient Networks
In the paper we present approaches to calculate single connections availability. Approximate calculations for the most representative protection topologies as well as for a partic...
Piotr Cholda, Andrzej Jajszczyk