Sciweavers

4212 search results - page 8 / 843
» On Compressible Pairings and Their Computation
Sort
View
78
Voted
SIGCOMM
2010
ACM
15 years 19 days ago
To compress or not to compress - compute vs. IO tradeoffs for mapreduce energy efficiency
Yanpei Chen, Archana Ganapathi, Randy H. Katz
193
Voted
ICIAR
2011
Springer
14 years 3 months ago
Lossless Compression of Satellite Image Sets Using Spatial Area Overlap Compensation
Abstract. In this paper we present a new prediction technique to compress a pair of satellite images that have significant overlap in the underlying spatial areas. When this predi...
Vivek Trivedi, Howard Cheng
100
Voted
CHINAF
2008
69views more  CHINAF 2008»
15 years 16 days ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang
77
Voted
TKDE
2008
107views more  TKDE 2008»
15 years 10 days ago
Computation and Monitoring of Exclusive Closest Pairs
Given two datasets A and B, their exclusive closest pairs (ECP) join is a one-to-one assignment of objects from the two datasets, such that (i) the closest pair (a, b) in A
Leong Hou U, Nikos Mamoulis, Man Lung Yiu
117
Voted
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 4 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian