Sciweavers

1709 search results - page 1 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
SIGIR
1999
ACM
13 years 9 months ago
Comparing the Performance of Database Selection Algorithms
Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...
James C. French, Allison L. Powell, James P. Calla...
JGAA
2007
135views more  JGAA 2007»
13 years 4 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
CBMS
2009
IEEE
13 years 11 months ago
Comparative study of spine vertebra shape retrieval using learning-based feature selection
Feature extraction and selection are two important steps for shape retrieval. Given a data set, a set of features which describe the shape property from different aspects are extr...
Haiying Guan, Sameer Antani, L. Rodney Long, Georg...
ICARIS
2005
Springer
13 years 10 months ago
A Comparative Study of Real-Valued Negative Selection to Statistical Anomaly Detection Techniques
The (randomized) real-valued negative selection algorithm is an anomaly detection approach, inspired by the negative selection immune system principle. The algorithm was proposed t...
Thomas Stibor, Jonathan Timmis, Claudia Eckert
EVOW
2003
Springer
13 years 10 months ago
A Genetic Algorithm for the Index Selection Problem
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...
Jozef Kratica, Ivana Ljubic, Dusan Tosic