Sciweavers

739 search results - page 52 / 148
» Sorting Algorithms
Sort
View
EDBTW
2006
Springer
14 years 14 days ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
DCC
2005
IEEE
14 years 8 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
RSCTC
2000
Springer
146views Fuzzy Logic» more  RSCTC 2000»
14 years 11 days ago
An Algorithm for Induction of Decision Rules Consistent with the Dominance Principle
Induction of decision rules within the dominance-based rough set approach to the multiple-criteria sorting decision problem is discussed in this paper. We introduce an algorithm ca...
Salvatore Greco, Benedetto Matarazzo, Roman Slowin...
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 2 months ago
Best Position Algorithms for Top-k Queries
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
STACS
2009
Springer
14 years 3 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
Tomás Ebenlendr, Jiri Sgall