2607 search results - page 54 / 522 » Complete Functional Synthesis |
116
click to vote
RTA
1991
Springer
15 years 6 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
120
Voted
PAMI
2007
15 years 2 months ago
2007
—This paper presents a new framework for the completion of missing information based on local structures. It poses the task of completion as a global optimization problem with a ...
143
click to vote
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
145
click to vote
CRYPTO
2003
Springer
15 years 8 months ago
2003
Springer
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
110
Voted
INFORMATICALT
2010
15 years 1 months ago
2010
To suitably complete an image without seams, block effects, and artifacts, a novel exemplar-based image completion model employing partial differential equation (PDE) is proposed. ...