Sciweavers

9842 search results - page 121 / 1969
» Problem complexity
Sort
View
TIME
2003
IEEE
15 years 3 months ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...
CORR
2006
Springer
130views Education» more  CORR 2006»
14 years 10 months ago
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...
Joseph Y. Halpern, Leandro Chaves Rêgo
INTERSPEECH
2010
14 years 4 months ago
Performance estimation of noisy speech recognition considering recognition task complexity
To ensure a satisfactory QoE (Quality of Experience) and facilitate system design in speech recognition services, it is essential to establish a method that can be used to efficie...
Takeshi Yamada, Tomohiro Nakajima, Nobuhiko Kitawa...
AAAI
2008
15 years 8 days ago
Reducing Particle Filtering Complexity for 3D Motion Capture using Dynamic Bayesian Networks
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
Cédric Rose, Jamal Saboune, François...
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
15 years 4 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody