Sciweavers

4212 search results - page 55 / 843
» On Compressible Pairings and Their Computation
Sort
View
107
Voted
CTRSA
2003
Springer
130views Cryptology» more  CTRSA 2003»
15 years 5 months ago
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
Kirsten Eisenträger, Kristin Lauter, Peter L....
BMVC
2002
15 years 3 months ago
Detecting Planes In An Uncalibrated Image Pair
Plane detection is a prerequisite to a wide variety of vision tasks. This paper proposes a novel method that exploits results from projective geometry to automatically detect plan...
Manolis I. A. Lourakis, Antonis A. Argyros, Stelio...
103
Voted
INFORMATICALT
2008
168views more  INFORMATICALT 2008»
15 years 17 days ago
A Pairing-Based User Authentication Scheme for Wireless Clients with Smart Cards
With rapid growth of mobile wireless networks, handheld devices are popularly used by people and many mobile applications have been rapidly developed. Considering the limited compu...
Yuh-Min Tseng, Tsu-Yang Wu, Jui-Di Wu
102
Voted
ACL
2010
14 years 10 months ago
Modeling Semantic Relevance for Question-Answer Pairs in Web Social Communities
Quantifying the semantic relevance between questions and their candidate answers is essential to answer detection in social media corpora. In this paper, a deep belief network is ...
Baoxun Wang, Xiaolong Wang, Chengjie Sun, Bingquan...
GC
2010
Springer
14 years 10 months ago
Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
Michael Ferrara, Michael S. Jacobson, Angela Harri...