Sciweavers

220 search results - page 38 / 44
» Distributed Minimum Cut Approximation
Sort
View
OSDI
1996
ACM
13 years 11 months ago
Online Data-Race Detection via Coherency Guarantees
We present the design and evaluation of an on-thefly data-race-detection technique that handles applications written for the lazy release consistent (LRC) shared memory model. We ...
Dejan Perkovic, Peter J. Keleher
COR
2004
111views more  COR 2004»
13 years 9 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
13 years 8 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
PPOPP
2011
ACM
13 years 19 days ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
MOBIHOC
2006
ACM
14 years 9 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano