1277 search results - page 86 / 256 » Terminating Decision Algorithms Optimally |
124
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
132
click to vote
TNN
1998
15 years 2 months ago
1998
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
133
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
116
click to vote
ICIP
2008
IEEE
15 years 9 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
132
click to vote
ICPP
1991
IEEE
15 years 6 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...