2430 search results - page 398 / 486 » Computing Tutte Polynomials |
140
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
106
click to vote
ICB
2009
Springer
15 years 8 months ago
2009
Springer
This paper proposes a statistical model for fingerprint ridge orientations. The active fingerprint ridge orientation model (AFROM) iteratively deforms to fit the orientation fi...
129
click to vote
ASIACRYPT
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
124
click to vote
CHES
2000
Springer
15 years 7 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
149
click to vote
AGP
1999
IEEE
15 years 7 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...