Sciweavers

297 search results - page 19 / 60
» On the Fastest Vickrey Algorithm
Sort
View
GD
2000
Springer
13 years 11 months ago
GRIP: Graph dRawing with Intelligent Placement
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...
Pawel Gajer, Stephen G. Kobourov
CHINAF
2008
69views more  CHINAF 2008»
13 years 7 months 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
IDEAL
2003
Springer
14 years 17 days ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
DCC
2010
IEEE
14 years 2 months ago
A New Searchable Variable-to-Variable Compressor
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
Nieves R. Brisaboa, Antonio Fariña, Juan-Ra...
AES
2000
Springer
117views Cryptology» more  AES 2000»
13 years 11 months ago
A Comparison of AES Candidates on the Alpha 21264
We compare the five candidates for the Advanced Encryption Standard based on their performance on the Alpha 21264, a 64-bit superscalar processor. There are several new features o...
Richard Weiss, Nathan L. Binkert