213 search results - page 3 / 43 » An approximative method for calculating performance measures... |
DSD
2008
IEEE
13 years 7 months ago
2008
IEEE
The aim of this work is to present a method for rounding quadratically converging algorithms that improves their performance. This method is able to reduce significantly the numbe...
CORR
2011
Springer
13 years 19 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...
SIGMETRICS
2002
ACM
13 years 5 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
ITCC
2003
IEEE
13 years 11 months ago
2003
IEEE
We present an efficient algorithm called the Quadtree Heuristic for identifying a list of similar terms for each unique term in a large document collection. Term similarity is de...
ICASSP
2009
IEEE
14 years 11 days ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...