3702 search results - page 25 / 741 » All Pairings Are in a Group |
115
click to vote
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
115
click to vote
PAIRING
2007
Springer
15 years 6 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...
83
Voted
BIBE
2004
IEEE
15 years 4 months ago
2004
IEEE
Current motif discovery methods can only detect individual motifs in groups of protein sequences--they do not discover potentially-interacting motif pairs underlying the interacti...
92
Voted
ICANNGA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The purpose of this work is to demonstrate that it is possible to cluster contact maps for pairs of alpha helices such that each of the clusters corresponds to a group of...
103
click to vote
IJHPCA
2010
14 years 11 months ago
2010
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...