429 search results - page 28 / 86 » Permutative Additives and Exponentials |
BIRTHDAY
1999
Springer
14 years 19 hour ago
1999
Springer
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute si...
ESANN
2004
13 years 9 months ago
2004
We derive analytical expressions of local codim-1-bifurcations for a fully connected, additive, discrete-time RNN, where we regard the external inputs as bifurcation parameters. Th...
NAACL
2004
13 years 9 months ago
2004
With the increasing use of research paper search engines, such as CiteSeer, for both literature search and hiring decisions, the accuracy of such systems is of paramount importanc...
UAI
2003
13 years 9 months ago
2003
We prove that perfect distributions exist when using a finite number of bits to represent the parameters of a Bayesian network. In addition, we provide an upper bound on the prob...
CCCG
1998
13 years 9 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...