3702 search results - page 36 / 741 » All Pairings Are in a Group |
101
click to vote
IACR
2011
14 years 3 days ago
2011
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter...
114
Voted
BMCBI
2004
15 years 10 days ago
2004
Background: Identifying all protein-protein interactions in an organism is a major objective of proteomics. A related goal is to know which protein pairs are present in the same p...
99
Voted
IJCPOL
2002
15 years 7 days ago
2002
The method to automatically extract translational Japanese-KATAKANA and English word pairs from bilingual corpora is proposed. The method applies all the existing transliteration ...
116
click to vote
SIAMCOMP
1998
15 years 3 days ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
122
click to vote
MFCS
2010
Springer
14 years 11 months ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...