1695 search results - page 103 / 339 » Linear, Polynomial or Exponential |
121
click to vote
NIPS
1996
15 years 5 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
131
click to vote
JSAC
2008
15 years 4 months ago
2008
We propose in this work a single copy and multi-hop opportunistic routing scheme for sparse delay tolerant networks (DTNs). The scheme uses as only input the estimates of the avera...
138
click to vote
ECCC
2000
15 years 4 months ago
2000
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
130
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
121
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...