2333 search results - page 208 / 467 » Recursive Computational Depth |
135
click to vote
JAR
1998
15 years 6 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
147
click to vote
TCS
2010
15 years 4 months ago
2010
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...
163
click to vote
ACL
2010
15 years 4 months ago
2010
We argue that groups of unannotated texts with overlapping and non-contradictory semantics represent a valuable source of information for learning semantic representations. A simp...
157
click to vote
CAP
2010
15 years 1 months ago
2010
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
157
click to vote
FPL
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Data dependent circuits are logic circuits specialized to specific input data. They are smaller and faster than the original circuits, although they are not reusable and...