Sciweavers

151 search results - page 4 / 31
» Timed Testing under Partial Observability
Sort
View
TASLP
2011
13 years 8 days ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský
LREC
2010
142views Education» more  LREC 2010»
13 years 6 months ago
Partial Parsing as a Method to Expedite Dependency Annotation of a Hindi Treebank
The paper describes an approach to expedite the process of manual annotation of a Hindi dependency treebank which is currently under development. We propose a way by which consist...
Mridul Gupta, Vineet Yadav, Samar Husain, Dipti Mi...
AAAI
2010
13 years 6 months ago
PUMA: Planning Under Uncertainty with Macro-Actions
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
Ruijie He, Emma Brunskill, Nicholas Roy
FORMATS
2005
Springer
13 years 11 months ago
Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets
Monitoring real-time concurrent systems is a challenging task. In this paper we formulate (model-based) supervision by means of hidden state history reconstruction, from event (e.g...
Thomas Chatain, Claude Jard
DAM
2007
85views more  DAM 2007»
13 years 5 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar