Sciweavers

1388 search results - page 179 / 278
» Approximability of Robust Network Design
Sort
View
JUCS
2010
109views more  JUCS 2010»
14 years 7 months ago
Semantics of Query-Driven Communication of Exact Values
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
Michal Konecný, Amin Farjudian
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 2 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
96
Voted
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 29 days ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
112
Voted
MOBIHOC
2008
ACM
16 years 4 days ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...
101
Voted
NCA
2009
IEEE
15 years 7 months ago
A Distributed Algorithm for Web Content Replication
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
Sharrukh Zaman, Daniel Grosu