204 search results - page 36 / 41 » Proposition-valued random variables as information |
107
Voted
LATIN
2010
Springer
14 years 10 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
NIPS
1998
15 years 1 months ago
1998
We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...
101
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
128
click to vote
SIAMCOMP
2002
14 years 11 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
92
Voted
ALMOB
2008
15 years 9 days ago
2008
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...