Sciweavers

2005 search results - page 172 / 401
» Decisive Markov Chains
Sort
View
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
15 years 6 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
CSDA
2008
62views more  CSDA 2008»
15 years 6 months ago
Waiting time distribution of generalized later patterns
In this paper the concept of later waiting time distributions for patterns in multi-state trials is generalized to cover a collection of compound patterns that must all be counted...
Donald E. K. Martin, John A. D. Aston
CP
2004
Springer
16 years 11 hour ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 1 months ago
Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
Guangyue Han, Brian H. Marcus
IUI
2010
ACM
16 years 3 months ago
A POMDP approach to P300-based brain-computer interfaces
Most of the previous work on non-invasive brain-computer interfaces (BCIs) has been focused on feature extraction and classification algorithms to achieve high performance for the...
Jaeyoung Park, Kee-Eung Kim, Sungho Jo