Sciweavers

1778 search results - page 215 / 356
» The Theory of Probabilistic Databases
Sort
View
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
15 years 3 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
POPL
2009
ACM
16 years 5 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
135
Voted
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 8 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
138
Voted
FC
2006
Springer
145views Cryptology» more  FC 2006»
15 years 8 months ago
Efficient Correlated Action Selection
Abstract. Participants in e-commerce and other forms of online collaborations tend to be selfish and rational, and therefore game theory has been recognized as particularly relevan...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...
SYNTHESE
2008
131views more  SYNTHESE 2008»
15 years 4 months ago
A new formulation of the Principle of Indifference
This article goes to the foundations of Statistical Inference through a review of Carnap's logic theory of induction. From this point of view, it brings another solution to t...
Rodolfo de Cristofaro