Sciweavers

814 search results - page 9 / 163
» Optimal pairings
Sort
View
ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 11 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
ICPR
2010
IEEE
14 years 4 months ago
Co-recognition of Actions in Video Pairs
In this paper, we present a method that recognizes single or multiple common actions between a pair of video sequences. We establish an energy function that evaluates geometric and...
Young Min Shin (Seoul National University), Minsu ...
IACR
2011
133views more  IACR 2011»
12 years 9 months ago
Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
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...
Craig Costello, Kristin Lauter, Michael Naehrig
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 10 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
ICASSP
2008
IEEE
14 years 4 months ago
Extracting question/answer pairs in multi-party meetings
Understanding multi-party meetings involves tasks such as dialog act segmentation and tagging, action item extraction, and summarization. In this paper we introduce a new task for...
Andreas Kathol, Gökhan Tür