2588 search results - page 85 / 518 » Applications of Kolmogorov complexity to computable model th... |
124
click to vote
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
Inspired by computational linguistic approaches to annotate the structures that occur in human dialogue, this paper describes a technique which encodes these structures as transfo...
131
click to vote
ESOP
2008
Springer
15 years 3 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
110
click to vote
NC
1998
15 years 3 months ago
1998
Many processes are composed of a n-fold repetition of some simpler process. If the whole process can be modeled with a neural network, we present a method to derive a model of the...
127
click to vote
AFRIGRAPH
2007
ACM
15 years 5 months ago
2007
ACM
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
131
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...