Sciweavers

2214 search results - page 160 / 443
» Complexity of Reasoning
Sort
View
152
Voted
LICS
2006
IEEE
15 years 9 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
126
Voted
CSL
2003
Springer
15 years 8 months ago
Comparing the Succinctness of Monadic Query Languages over Finite Trees
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
Martin Grohe, Nicole Schweikardt
IV
2002
IEEE
95views Visualization» more  IV 2002»
15 years 8 months ago
Visualising Human Dialog
Human dialogue is so complex that definitively analysing patterns of conversation may well be impossible. Within a conversation, all the complexities and ambiguities of natural la...
Annie Tat, M. Sheelagh T. Carpendale
132
Voted
ICIP
1999
IEEE
15 years 7 months ago
Edge Directed Prediction for Lossless Compression of Natural Images
This paper sheds light on the recent least-square (LS)-based adaptive prediction schemes for lossless compression of natural images. Our analysis shows that the superiority of the ...
Xin Li, Michael T. Orchard
ARTS
1999
Springer
15 years 7 months ago
Specifying Performance Measures for PEPA
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
Graham Clark, Stephen Gilmore, Jane Hillston