Ehud D. Karnin

Publication Activity (10 Years)

Years Active: 1981-2010
Publications (10 Years): 0

Publications

Ehud D. Karnin, Eugene Walach, Tal Drory
Crowdsourcing in the Document Processing Practice - (A Short Practitioner/Visionary Paper). ICWE Workshops (2010)
Geir E. Øien, Zachi Baharav, Skjalg Lepsøy, Ehud D. Karnin
A new improved collage theorem with applications to multiresolution fractal image coding. ICASSP (5) (1994)
Dan Chevion, Ehud D. Karnin, Eugene Walach
High Efficiency, Multiplication Free Approximation of Arithmetic Coding. Data Compression Conference (1991)
Ehud D. Karnin
A simple procedure for pruning back-propagation trained neural networks. IEEE Trans. Neural Networks 1 (2) (1990)
Eugene Walach, Ehud D. Karnin
A fractal based approach to image compression. ICASSP (1986)
Justin M. Reyneri, Ehud D. Karnin
Coin flipping by telephone. IEEE Trans. Inf. Theory 30 (5) (1984)
Ehud D. Karnin
A Parallel Algorithm for the Knapsack Problem. IEEE Trans. Computers 33 (5) (1984)
Ehud D. Karnin, J. W. Greene, Martin E. Hellman
On secret sharing systems. IEEE Trans. Inf. Theory 29 (1) (1983)
Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri
On the necessity of cryptanalytic exhaustive search. SIGACT News 15 (1) (1983)
Ehud D. Karnin, Martin E. Hellman
The largest super-increasing subset of a random set. IEEE Trans. Inf. Theory 29 (1) (1983)
Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri
Compact knapsacks are polynomially solvable. SIGACT News 15 (1) (1983)
Robert M. Gray, Ehud D. Karnin
Multiple local optima in vector quantizers. IEEE Trans. Inf. Theory 28 (2) (1982)
Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri
On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis. CRYPTO (1981)
Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri
A Polynomial Time Solution for Compact Knapsacks. CRYPTO (1981)