Sciweavers

974 search results - page 50 / 195
» pairing 2010
Sort
View
COMGEO
2010
ACM
13 years 7 months ago
Highway hull revisited
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distanc...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
MOBISYS
2010
ACM
13 years 10 months ago
Ensemble: cooperative proximity-based authentication
Ensemble is a system that uses a collection of trusted personal devices to provide proximity-based authentication in pervasive environments. Users are able to securely pair their ...
Andre Kalamandeen, Adin Scannell, Eyal de Lara, An...
SEMWEB
2010
Springer
13 years 5 months ago
Using SPARQL to Test for Lattices: Application to Quality Assurance in Biomedical Ontologies
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
Guo-Qiang Zhang, Olivier Bodenreider
CVPR
2010
IEEE
14 years 1 months ago
Line Matching Leveraged By Point Correspondences
A novel method for line matching is proposed. The basic idea is to use tentative point correspondences, which can be easily obtained by keypoint matching methods, to significantly...
Bin Fan, Fuchao Wu, Zhanyi Hu
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
13 years 9 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...