Sciweavers

2316 search results - page 30 / 464
» The many forms of hypercomputation
Sort
View
107
Voted
ACL
1996
15 years 5 months ago
On Reversing the Generation Process in Optimality Theory
Optimality Theory, a constraint-based phonology and morphology paradigm, has allowed linguists to make elegant analyses of many phenomena, including infixation and reduplication. ...
J. Eric Fosler
IGPL
2007
107views more  IGPL 2007»
15 years 3 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
Marcelo Finger, Dov M. Gabbay
IFIPTCS
2010
15 years 1 months ago
Polarized Resolution Modulo
We present a restriction of Resolution modulo where the rewrite rules are such that clauses rewrite to clauses, so that the reduct of a clause needs not be further transformed into...
Gilles Dowek
126
Voted
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
15 years 3 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
CVPR
2001
IEEE
16 years 6 months ago
A Subspace Approach to Layer Extraction
Representing images with layers has many important applications, such as video compression, motion analysis, and 3D scene analysis. This paper presents an approach to reliably ext...
Qifa Ke, Takeo Kanade