Sciweavers

4212 search results - page 6 / 843
» On Compressible Pairings and Their Computation
Sort
View
CIAC
2000
Springer
118views Algorithms» more  CIAC 2000»
13 years 11 months ago
Speeding Up Pattern Matching by Text Compression
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Ma...
PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 5 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
Sorina Ionica, Antoine Joux
IPL
2006
86views more  IPL 2006»
13 years 7 months ago
On the relationship between squared pairings and plain pairings
In this paper, we investigate the relationship between the squared Weil/Tate pairing and the plain Weil/Tate pairing. Along these lines, we first show that the squared pairing for ...
Bo Gyeong Kang, Je Hong Park
DCC
2007
IEEE
14 years 7 months ago
High Throughput Compression of Double-Precision Floating-Point Data
This paper describes FPC, a lossless compression algorithm for linear streams of 64-bit floating-point data. FPC is designed to compress well while at the same time meeting the hi...
Martin Burtscher, Paruj Ratanaworabhan
BMCBI
2010
143views more  BMCBI 2010»
13 years 4 months ago
A genome alignment algorithm based on compression
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison