Sciweavers

23201 search results - page 131 / 4641
» Rewriting Systems with Data
Sort
View
INDOCRYPT
2005
Springer
15 years 11 months ago
Completion Attacks and Weak Keys of Oleshchuk's Public Key Cryptosystem
This paper revisits a public key cryptosystem which is based on finite string-rewriting systems. We consider a new approach for cryptanalysis of such proposals—the so-called com...
Heiko Stamer
NAACL
2003
15 years 7 months ago
Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence Alignment
We address the text-to-text generation problem of sentence-level paraphrasing — a phenomenon distinct from and more difficult than word- or phrase-level paraphrasing. Our appro...
Regina Barzilay, Lillian Lee
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
15 years 5 months ago
Three-Letter-Pattern-Avoiding Permutations and Functional Equations
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
Ghassan Firro, Toufik Mansour
154
Voted
CORR
2006
Springer
88views Education» more  CORR 2006»
15 years 5 months ago
Polynomial Time Nondimensionalisation of Ordinary Differential Equations via their Lie Point Symmetries
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
Evelyne Hubert, Alexandre Sedoglavic
173
Voted
CORR
2011
Springer
174views Education» more  CORR 2011»
15 years 15 days ago
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
Georg Moser, Andreas Schnabl