877 search results - page 10 / 176 » Structural Cut Elimination |
168
click to vote
ICCAD
2006
IEEE
16 years 2 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
188
click to vote
TCS
2011
15 years 24 days ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
151
click to vote
RTA
2010
Springer
15 years 9 months ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
167
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
183
click to vote
SIGIR
1995
ACM
15 years 9 months ago
1995
ACM
This paper studies noise reduction for computational efficiency improvements in a statistical learning method for text categorization, the Linear Least Squares Fit (LLSF) mapping...