4498 search results - page 132 / 900 » How to Invent Functions |
180
Voted
CPP
2011
14 years 2 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...
114
click to vote
AINA
2007
IEEE
15 years 8 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...
148
Voted
EMMCVPR
2011
Springer
14 years 2 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...
101
click to vote
EUROCAST
1997
Springer
15 years 6 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...
127
Voted
COMBINATORICS
1998
15 years 2 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...