730 search results - page 27 / 146 » Combinatorics of Monotone Computations |
120
click to vote
AAAI
2008
15 years 6 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...
124
Voted
STACS
2005
Springer
15 years 9 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...
127
click to vote
EMMCVPR
2001
Springer
15 years 8 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...
123
click to vote
ICIP
1995
IEEE
16 years 5 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...
126
click to vote
ALT
2005
Springer
16 years 1 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 ...