72 search results - page 4 / 15 » On a syntactic approximation to logics that capture complexi... |
CGF
2005
13 years 7 months ago
2005
We present a technique which allows capture of 3D surface geometry and a useful class of BRDFs using extremely simple equipment. A standard digital camera with an attached flash s...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
IANDC
2006
13 years 7 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
LPAR
2004
Springer
14 years 23 days ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
EACL
1993
ACL Anthology
13 years 8 months ago
1993
ACL Anthology
The paper shows how the verbal lexicon can be formalised in a way that captures and exploits generalisations about the alternation behaviour of verb classes. An alternation is a p...