4924 search results - page 270 / 985 » Efficiency Improvement for NTRU |
166
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...
156
click to vote
ACL
2010
15 years 4 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
180
click to vote
KSEM
2010
Springer
15 years 4 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
159
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...
162
click to vote
IMCSIT
2010
15 years 1 months ago
2010
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...