740 search results - page 102 / 148 » Lower bounds for Buchsbaum* complexes |
177
click to vote
LFCS
2007
Springer
16 years 10 days ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
169
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
165
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
148
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
173
click to vote
KI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...