11160 search results - page 131 / 2232 » Incompleteness in a General Setting |
125
click to vote
COCO
1991
Springer
15 years 4 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
96
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
There is a notable interest in extending probabilistic generative modeling principles to accommodate for more complex structured data types. In this paper we develop a generative ...
97
Voted
ICLP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
101
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
131
Voted
ECCC
2006
15 years 22 days ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...