10608 search results - page 663 / 2122 » Complexity of O'Hara's Algorithm |
202
click to vote
PAIRING
2007
Springer
16 years 1 months ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
236
click to vote
CCECE
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
210
click to vote
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
160
click to vote
ICMCS
2006
IEEE
16 years 1 months ago
2006
IEEE
—This paper presents a novel block-based fast compression (BFC) algorithm for compound images that contain graphics, text and natural images. The images are divided to blocks, wh...
143
click to vote
ISCAS
2005
IEEE
16 years 26 days ago
2005
IEEE
—This paper describes a clipping engine, which processes the view clipping, perspective division, and view-port mapping of 3D graphics. Complexity of polygon clipping algorithm c...