Sciweavers

AMC
2007
86views more  AMC 2007»
13 years 4 months ago
Further refinement of pairing computation based on Miller's algorithm
In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate Pairings. In this paper we extend their work and propose a generalized algo...
Chao-Liang Liu, Gwoboa Horng, Te-Yu Chen
AIPS
1994
13 years 6 months ago
Design Tradeoffs in Partial Order (Plan space) Planning
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
Subbarao Kambhampati
VLDB
2004
ACM
119views Database» more  VLDB 2004»
14 years 5 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran