Sciweavers

4302 search results - page 41 / 861
» Index Pairs Algorithms
Sort
View
DASFAA
2005
IEEE
90views Database» more  DASFAA 2005»
14 years 1 months ago
Towards Optimal Utilization of Main Memory for Moving Object Indexing
In moving object databases, existing disk-based indexes are unable to keep up with the high update rate while providing speedy retrieval at the same time. However, efficient manage...
Bin Cui, Dan Lin, Kian-Lee Tan
ICONS
2008
IEEE
14 years 2 months ago
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the ...
Giray Kömürcü, Erkay Savas
CIVR
2008
Springer
279views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Semi-supervised learning of object categories from paired local features
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
Wen Wu, Jie Yang
JCB
2000
129views more  JCB 2000»
13 years 7 months ago
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
Martin Fekete, Ivo L. Hofacker, Peter F. Stadler
LATINCRYPT
2010
13 years 6 months ago
Fixed Argument Pairings
A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In th...
Craig Costello, Douglas Stebila