Sciweavers

50 search results - page 5 / 10
» Language Compression and Pseudorandom Generators
Sort
View
EMNLP
2011
12 years 7 months ago
Learning Sentential Paraphrases from Bilingual Parallel Corpora for Text-to-Text Generation
Previous work has shown that high quality phrasal paraphrases can be extracted from bilingual parallel corpora. However, it is not clear whether bitexts are an appropriate resourc...
Juri Ganitkevitch, Chris Callison-Burch, Courtney ...
ICASSP
2008
IEEE
14 years 1 months ago
Robust video fingerprints based on subspace embedding
We present a novel video fingerprinting method based on subspace embedding. The proposed method is particularly robust against frame-rate conversion attacks and geometric attacks...
Regunathan Radhakrishnan, Claus Bauer
FOCS
2000
IEEE
13 years 12 months ago
Zaps and Their Applications
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
Cynthia Dwork, Moni Naor
WWW
2004
ACM
14 years 8 months ago
Optimization of html automatically generated by wysiwyg programs
Automatically generated HTML, as produced by WYSIWYG programs, typically contains much repetitive and unnecessary markup. This paper identifies aspects of such HTML that may be al...
Jacqueline Spiesser, Les Kitchen
DLT
2004
13 years 8 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda