144227 search results - page 28543 / 28846 » Using the |
136
click to vote
CJTCS
1999
15 years 4 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
161
click to vote
CN
1999
15 years 4 months ago
1999
Today's Internet appliances feature user interface technologies almost unknown a few years ago: touch screens, styli, handwriting and voice recognition, speech synthesis, tin...
138
click to vote
IJON
1998
15 years 4 months ago
1998
Paper [1] aimed at providing a unified presentation of neural network architectures. We show in the present comment (i) that the canonical form of recurrent neural networks presen...
COMBINATORICS
1999
15 years 4 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
147
click to vote
INFORMS
1998
15 years 4 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...