Sciweavers

849 search results - page 10 / 170
» The Early Restart Algorithm
Sort
View
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
15 years 11 months ago
Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results
This paper introduces the hash-merge join algorithm (HMJ, for short); a new non-blocking join algorithm that deals with data items from remote sources via unpredictable, slow, or ...
Mohamed F. Mokbel, Ming Lu, Walid G. Aref
IPPS
2009
IEEE
15 years 4 months ago
Early experiences on accelerating Dijkstra's algorithm using transactional memory
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
Nikos Anastopoulos, Konstantinos Nikas, Georgios I...
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
15 years 2 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
ISMIR
2005
Springer
120views Music» more  ISMIR 2005»
15 years 3 months ago
Melodic Similarity Algorithms -- Using Similarity Ratings for Development and Early Evaluation
This paper focuses on gathering similarity ratings for use in the construction, optimization and evaluation of melodic similarity algorithms. The approach involves conducting list...
Margaret Cahill, Donncha Ó. Maidín
EUROCRYPT
2001
Springer
15 years 2 months ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley