Sciweavers

2814 search results - page 335 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
13 years 10 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
MICAI
2005
Springer
14 years 4 months ago
Directed Cycles in Bayesian Belief Networks: Probabilistic Semantics and Consistency Checking Complexity
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
Alexander L. Tulupyev, Sergey I. Nikolenko
DEBS
2007
ACM
14 years 2 months ago
On adding replies to publish-subscribe
Recently, the publish-subscribe communication model has attracted the attention of developers as a viable alternative to traditional communication schemas, like request/reply, for...
Gianpaolo Cugola, Matteo Migliavacca, Alessandro M...
KDD
2009
ACM
194views Data Mining» more  KDD 2009»
14 years 11 months ago
Combining link and content for community detection: a discriminative approach
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
Tianbao Yang, Rong Jin, Yun Chi, Shenghuo Zhu
MOBIHOC
2007
ACM
14 years 10 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...