Sciweavers

2638 search results - page 426 / 528
» Random Geometric Complexes
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 2 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
ATAL
2008
Springer
13 years 11 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...
PDPTA
2004
13 years 11 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
IJCAI
1989
13 years 10 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine
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...