4498 search results - page 132 / 900 » How to Invent Functions |
CPP
2011
12 years 10 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
AINA
2007
IEEE
14 years 4 months ago
2007
IEEE
—Wireless and mobile networks have experienced great success over the past few years. However, any single type of wireless and mobile network cannot provide all types of services...
EMMCVPR
2011
Springer
12 years 10 months ago
2011
Springer
The recently proposed ImageNet dataset consists of several million images, each annotated with a single object category. However, these annotations may be imperfect, in the sense t...
EUROCAST
1997
Springer
14 years 2 months ago
1997
Springer
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
COMBINATORICS
1998
13 years 10 months ago
1998
Using Zeilberger’s factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that defines their generating function according t...