Sciweavers

4536 search results - page 318 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
CCGRID
2007
IEEE
16 years 1 months ago
Relative Performance of Scheduling Algorithms in Grid Environments
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
Yang Zhang, Charles Koelbel, Ken Kennedy
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 10 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
ADC
2008
Springer
143views Database» more  ADC 2008»
15 years 8 months ago
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
Dongyang Li, Chunping Li
TCAD
2008
124views more  TCAD 2008»
15 years 6 months ago
An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input corre...
Neil Kettle, Andy King
ACSC
2006
IEEE
16 years 25 days ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda