Sciweavers

244 search results - page 43 / 49
» On-Line Probability, Complexity and Randomness
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
BMCBI
2008
116views more  BMCBI 2008»
13 years 9 months ago
MScanner: a classifier for retrieving Medline citations
Background: Keyword searching through PubMed and other systems is the standard means of retrieving information from Medline. However, ad-hoc retrieval systems do not meet all of t...
Graham L. Poulter, Daniel L. Rubin, Russ B. Altman...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 9 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 6 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
PODC
2005
ACM
14 years 2 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer