Sciweavers

5158 search results - page 728 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 10 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
PODC
2010
ACM
15 years 10 months ago
Brief announcement: towards robust medium access in multi-hop networks
This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam ...
Andréa W. Richa, Jin Zhang, Christian Schei...
PODC
2010
ACM
15 years 10 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
PODC
2010
ACM
15 years 10 months ago
Brief announcement: asynchronous bounded expected delay networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
PODC
2010
ACM
15 years 10 months ago
Group mutual exclusion in O(log n) RMR
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
Vibhor Bhatt, Chien-Chung Huang