Sciweavers

380 search results - page 28 / 76
» Process Algebra and Markov Chains
Sort
View
QUESTA
2006
119views more  QUESTA 2006»
13 years 7 months ago
Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
Ivo J. B. F. Adan, Vidyadhar G. Kulkarni
FOCS
2007
IEEE
14 years 1 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
MONET
2007
98views more  MONET 2007»
13 years 7 months ago
A Markov Model for Indoor Ultra-wideband Channel with People Shadowing
Abstract For an indoor ultra-wideband (UWB) communication system, the line-of-sight (LOS) between the transmitter and receiver may be frequently blocked by moving people. Blocking ...
Ruonan Zhang, Lin Cai
INFOCOM
2006
IEEE
14 years 1 months ago
Constant-Complexity Models for Wireless Channels
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
Syed A. Khayam, Hayder Radha
ICASSP
2011
IEEE
12 years 11 months ago
Optimal structure of memory models for lossless compression of binary image contours
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Ioan Tabus, Septimia Sarbu