165 search results - page 31 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
174
Voted
ALT
1995
Springer
15 years 9 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
163
Voted
CVBIA
2005
Springer
15 years 11 months ago
2005
Springer
Most variational active contour models are designed to find the “desirable” local minima of data-dependent energy functionals with the hope of avoiding undesirable configurat...
168
Voted
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
197
Voted
NEUROSCIENCE
2001
Springer
15 years 10 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
156
Voted
NIPS
1997
15 years 7 months ago
1997
A Lyapunov function for excitatory-inhibitory networks is constructed. The construction assumes symmetric interactions within excitatory and inhibitory populations of neurons, and...