Sciweavers

1000 search results - page 115 / 200
» Nominal rewriting systems
Sort
View
XSYM
2004
Springer
88views Database» more  XSYM 2004»
14 years 3 months ago
Teaching Relational Optimizers About XML Processing
Due to their numerous benefits, relational systems play a major role in storing XML documents. XML also benefits relational systems by providing a means to publish legacy relatio...
Sihem Amer-Yahia, Yannis Kotidis, Divesh Srivastav...
DATE
2008
IEEE
137views Hardware» more  DATE 2008»
14 years 4 months ago
SPARE - a Scalable algorithm for passive, structure preserving, Parameter-Aware model order REduction
In this paper we describe a flexible and efficient new algorithm for model order reduction of parameterized systems. The method is based on the reformulation of the parametric s...
Jorge Fernandez Villena, Luis Miguel Silveira
INDOCRYPT
2005
Springer
14 years 3 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
13 years 11 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»
13 years 10 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