Ehud D. Karnin

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