Sciweavers

590 search results - page 9 / 118
» Can We Learn to Beat the Best Stock
Sort
View
SCALESPACE
2001
Springer
15 years 2 months ago
Down-Scaling for Better Transform Compression
Abstract. The most popular lossy image compression method used on the Internet is the JPEG standard. JPEG’s good compression performance and low computational and memory complexi...
Alfred M. Bruckstein, Michael Elad, Ron Kimmel
FSE
1993
Springer
89views Cryptology» more  FSE 1993»
15 years 1 months ago
Parallel FFT-Hashing
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
Claus-Peter Schnorr, Serge Vaudenay
ICALP
2005
Springer
15 years 3 months ago
Basing Cryptographic Protocols on Tamper-Evident Seals
Abstract. In this paper we attempt to formally study two very intuitive physical models: sealed envelopes and locked boxes, often used as illustrations for common cryptographic ope...
Tal Moran, Moni Naor
ACL
2010
14 years 7 months ago
Profiting from Mark-Up: Hyper-Text Annotations for Guided Parsing
We show how web mark-up can be used to improve unsupervised dependency parsing. Starting from raw bracketings of four common HTML tags (anchors, bold, italics and underlines), we ...
Valentin I. Spitkovsky, Daniel Jurafsky, Hiyan Als...
ICML
2004
IEEE
15 years 10 months ago
Text categorization with many redundant features: using aggressive feature selection to make SVMs competitive with C4.5
Text categorization algorithms usually represent documents as bags of words and consequently have to deal with huge numbers of features. Most previous studies found that the major...
Evgeniy Gabrilovich, Shaul Markovitch