Sciweavers

421 search results - page 76 / 85
» CSL
Sort
View
CSL
2009
Springer
13 years 11 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
QEST
2007
IEEE
14 years 1 months ago
Performance Trees: Expressiveness and Quantitative Semantics
—Performance Trees are a recently-proposed mechanism for the specification of performance properties and measures. They represent an attractive alternative to stochastic logics,...
Tamas Suto, Jeremy T. Bradley, William J. Knottenb...
PCM
2004
Springer
131views Multimedia» more  PCM 2004»
14 years 22 days ago
Vision-Based Sign Language Recognition Using Sign-Wise Tied Mixture HMM
Abstract. In this paper, a new sign-wise tied mixture HMM (SWTMHMM) is proposed and applied in vision-based sign language recognition (SLR). In the SWTMHMM, the mixture densities o...
Liangguo Zhang, Gaolin Fang, Wen Gao, Xilin Chen, ...
ESOP
2010
Springer
14 years 4 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
CSL
2007
Springer
14 years 1 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann