889 search results - page 48 / 178 » Problems in Rewriting III |
NAACL
2003
13 years 11 months ago
2003
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...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
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. ...
ESSLLI
2009
Springer
13 years 7 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
EDBT
2012
ACM
12 years 9 days ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
IPPS
2002
IEEE
14 years 2 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...