730 search results - page 27 / 146 » Combinatorics of Monotone Computations |
AAAI
2008
13 years 11 months ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
STACS
2005
Springer
14 years 2 months ago
2005
Springer
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
EMMCVPR
2001
Springer
14 years 1 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
ICIP
1995
IEEE
14 years 10 months ago
1995
IEEE
Receiver operating characteristics (ROC) curves have the property that they start at (0,l) and end at (1,O) and are monotonically decreasing. Furthermore, a parametric representat...
ALT
2005
Springer
14 years 5 months ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...