2080 search results - page 215 / 416 » Measuring empirical computational complexity |
155
click to vote
ISIPTA
2005
IEEE
15 years 10 months ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
91
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...
144
Voted
JMLR
2006
15 years 5 months ago
2006
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
157
Voted
CORR
2011
Springer
15 years 3 days ago
2011
Springer
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
146
click to vote
ICIP
2001
IEEE
16 years 6 months ago
2001
IEEE
There are many mode decisions in the video coding process that are used to optimize the performance in terms of the bit rate, the speed and the quality of the decoded video. We de...