8486 search results - page 301 / 1698 » Ordered Enumeration Method |
121
click to vote
ANTS
2004
Springer
15 years 10 months ago
2004
Springer
We present a non-archimedean method to construct, given an integer N ≥ 1, a finite field Fq and an elliptic curve E/Fq such that E(Fq) has order N.
161
Voted
ACL
2012
13 years 7 months ago
2012
Reordering is a difficult task in translating between widely different languages such as Japanese and English. We employ the postordering framework proposed by (Sudoh et al., 201...
140
click to vote
CADE
2001
Springer
15 years 9 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
151
Voted
NAACL
2004
15 years 6 months ago
2004
We consider the problem of modeling the content structure of texts within a specific domain, in terms of the topics the texts address and the order in which these topics appear. W...
160
click to vote
PVLDB
2010
14 years 11 months ago
2010
We present a new indexing method named ZINC (for Z-order Indexing with Nested Code) that supports efficient skyline computation for data with both totally and partially ordered at...