2005 search results - page 281 / 401 » Decisive Markov Chains |
109
click to vote
ICRA
2006
IEEE
15 years 7 months ago
2006
IEEE
— This paper considers the problem of tracking an unknown number of targets using a wireless sensor network for surveillance. In particular, we consider the case in which each se...
104
click to vote
MEMOCODE
2006
IEEE
15 years 7 months ago
2006
IEEE
Data flow models are used for specifying and analysing signal processing and streaming applications. However, traditional data flow models are either not capable of expressing t...
101
click to vote
QEST
2006
IEEE
15 years 7 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
113
click to vote
VTC
2006
IEEE
15 years 7 months ago
2006
IEEE
— Performance comparison of multiuser OFDM-TDMA and OFDMA systems by considering physical and link cross-layer behavior is conducted in this work. We provide a new framework for ...
105
click to vote
SIGIR
2006
ACM
15 years 7 months ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...