Sciweavers

1007 search results - page 162 / 202
» The Complexity of Futile Questioning
Sort
View
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 1 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
ICASSP
2011
IEEE
13 years 1 months ago
Evaluating music sequence models through missing data
Building models of the structure in musical signals raises the question of how to evaluate and compare different modeling approaches. One possibility is to use the model to impute...
Thierry Bertin-Mahieux, Graham Grindlay, Ron J. We...
ICASSP
2011
IEEE
13 years 1 months ago
Secure video processing: Problems and challenges
Secure signal processing is an emerging technology to enable signal processing tasks in a secure and privacy-preserving fashion. It has attracted a great amount of research attent...
Wenjun Lu, Avinash L. Varna, Min Wu
STACS
2010
Springer
14 years 5 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
GECCO
2009
Springer
151views Optimization» more  GECCO 2009»
14 years 4 months ago
Evolution of functional specialization in a morphologically homogeneous robot
A central tenet of embodied artificial intelligence is that intelligent behavior arises out of the coupled dynamics between an agent’s body, brain and environment. It follows t...
Joshua S. Auerbach, Josh C. Bongard