Sciweavers

10412 search results - page 1949 / 2083
» The efficiency of algorithms - misconceptions
Sort
View
112
Voted
KDD
2010
ACM
188views Data Mining» more  KDD 2010»
15 years 6 months ago
Inferring networks of diffusion and influence
Information diffusion and virus propagation are fundamental processes talking place in networks. While it is often possible to directly observe when nodes become infected, observi...
Manuel Gomez-Rodriguez, Jure Leskovec, Andreas Kra...
154
Voted
DLS
2008
149views Languages» more  DLS 2008»
15 years 5 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
ALT
2010
Springer
15 years 5 months ago
Contrast Pattern Mining and Its Application for Building Robust Classifiers
: The ability to distinguish, differentiate and contrast between different data sets is a key objective in data mining. Such ability can assist domain experts to understand their d...
Kotagiri Ramamohanarao
148
Voted
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 5 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
128
Voted
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 5 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
« Prev « First page 1949 / 2083 Last » Next »