Sciweavers

264 search results - page 52 / 53
» On Linear Cryptanalysis with Many Linear Approximations
Sort
View
TNN
1998
114views more  TNN 1998»
13 years 5 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan
ISBI
2004
IEEE
14 years 6 months ago
Fast Multiresolution Photon-Limited Image Reconstruction
The techniques described in this paper allow multiscale photon-limited image reconstruction methods to be implemented with significantly less computational complexity than previou...
Rebecca Willett, Robert Nowak
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 10 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
13 years 10 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
VISUALIZATION
1991
IEEE
13 years 9 months ago
A Tool for Visualizing the Topology of Three-Dimensional Vector Fields
We describe a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three dimensional vector field, v, to produce a single, relativel...
Al Globus, C. Levit, T. Lasinski