4352 search results - page 36 / 871 » A Representation Theorem and Applications |
141
click to vote
TLCA
2009
Springer
15 years 8 months ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
103
click to vote
AMW
2010
15 years 3 months ago
2010
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...
133
click to vote
IJCAI
1989
15 years 3 months ago
1989
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...
130
click to vote
IANDC
2008
15 years 2 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
ICIP
1997
IEEE
16 years 3 months ago
1997
IEEE
A new method termed the vertex representation is presented for approximating the shapes of objects of arbitrary dimensionality d (e.g., 20, 30, etc.) with orthogonal (d - 1)-dimen...