6894 search results - page 312 / 1379 » Generation Problems |
172
Voted
MFCS
2007
Springer
16 years 25 days ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
171
click to vote
MKM
2007
Springer
16 years 25 days ago
2007
Springer
We address the problem of automatic synthesis of decision procedures. Our synthesis mechanism consists of several stages and submechanisms and is well-suited to the proof-planning ...
187
click to vote
FSTTCS
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
211
click to vote
EUROCRYPT
2010
Springer
15 years 10 months ago
2010
Springer
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in...
173
click to vote
ANLP
2000
15 years 8 months ago
2000
A major obstacle to the construction of a probabilistic translation model is the lack of large parallel corpora. In this paper we first describe a parallel text mining system that...