Sciweavers

2990 search results - page 557 / 598
» Hidden Markov processes
Sort
View
JCSS
2006
56views more  JCSS 2006»
14 years 9 months ago
Determining model accuracy of network traces
Accurate network modeling is critical to the design of network protocols. Traditional modeling approaches, such as Discrete Time Markov Chains (DTMC) are limited in their ability ...
Almudena Konrad, Ben Y. Zhao, Anthony D. Joseph
JMLR
2006
190views more  JMLR 2006»
14 years 9 months ago
Causal Graph Based Decomposition of Factored MDPs
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...
Anders Jonsson, Andrew G. Barto
MOR
2008
87views more  MOR 2008»
14 years 9 months ago
On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP
We consider the average cost problem for partially observable Markov decision processes (POMDP) with finite state, observation, and control spaces. We prove that there exists an -...
Huizhen Yu, Dimitri P. Bertsekas
PAMI
2008
137views more  PAMI 2008»
14 years 9 months ago
IRGS: Image Segmentation Using Edge Penalties and Region Growing
This paper proposes an image segmentation method named iterative region growing using semantics (IRGS), which is characterized by two aspects. First, it uses graduated increased ed...
Qiyao Yu, David A. Clausi
TCOM
2008
68views more  TCOM 2008»
14 years 9 months ago
Analysis and design of book-ahead bandwidth-sharing mechanisms
In this article, we present a novel discrete-time Markov chain model of book-ahead bandwidthsharing mechanisms. We use this analytical model and a simulation model to understand t...
Xiangfei Zhu, Malathi Veeraraghavan