Sciweavers

287 search results - page 23 / 58
» Data-Driven Constructive Induction
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
Model-level data-driven sub-units for signs in videos of continuous Sign Language
We investigate the issue of sign language automatic phonetic subunit modeling, that is completely data driven and without any prior phonetic information. A first step of visual p...
Stavros Theodorakis, Vassilis Pitsikalis, Petros M...
FLOPS
2006
Springer
13 years 11 months ago
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the in...
Gilles Barthe, Julien Forest, David Pichardie, Vla...
ENTCS
2008
73views more  ENTCS 2008»
13 years 7 months ago
Invariants for Non-Hierarchical Object Structures
We present a Hoare-style specification and verification approach for invariants in sequential OO programs. It allows invariants over nonhierarchical object structures, in which upd...
Ronald Middelkoop, Cornelis Huizing, Ruurd Kuiper,...
ENTCS
2006
162views more  ENTCS 2006»
13 years 7 months ago
Continuous Functions on Final Coalgebras
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
Neil Ghani, Peter Hancock, Dirk Pattinson
LICS
1994
IEEE
13 years 11 months ago
McColm's Conjecture
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of nite structures if every (FO + LFP) formula is equivalent to a rst-order formula in K. H...
Yuri Gurevich, Neil Immerman, Saharon Shelah