Sciweavers

1532 search results - page 202 / 307
» The Symbol Grounding Problem
Sort
View
TNN
2008
88views more  TNN 2008»
15 years 4 months ago
A New Approach to Knowledge-Based Design of Recurrent Neural Networks
Abstract-- A major drawback of artificial neural networks (ANNs) is their black-box character. This is especially true for recurrent neural networks (RNNs) because of their intrica...
Eyal Kolman, Michael Margaliot
LPAR
2010
Springer
15 years 2 months ago
Synthesis of Trigger Properties
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for temporal synthesis, l...
Orna Kupferman, Moshe Y. Vardi
TIT
2011
119views more  TIT 2011»
14 years 11 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
ICB
2009
Springer
183views Biometrics» more  ICB 2009»
15 years 11 months ago
Overview of the Multiple Biometrics Grand Challenge
The goal of the Multiple Biometrics Grand Challenge (MBGC) is to improve the performance of face and iris recognition technology from biometric samples acquired under unconstrained...
P. Jonathon Phillips, Patrick J. Flynn, J. Ross Be...
PLDI
2009
ACM
15 years 11 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...