Sciweavers

417 search results - page 3 / 84
» Performance Analysis of Three Text-Join Algorithms
Sort
View
WG
2007
Springer
15 years 3 months ago
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...
Matthias Hagen
80
Voted
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
15 years 4 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen
IPPS
1998
IEEE
15 years 1 months ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun
ICISS
2007
Springer
15 years 1 months ago
Performance Analysis for Multi Sensor Fingerprint Recognition System
The increasing use of distributed authentication architecture has made interoperability of systems an important issue. Interoperability of systems reflects the maturity of the tech...
Shimon K. Modi, Stephen J. Elliott, Hakil Kim
BCI
2009
IEEE
15 years 4 months ago
On the Performance of SVD-Based Algorithms for Collaborative Filtering
—In this paper, we describe and compare three Collaborative Filtering (CF) algorithms aiming at the low-rank approximation of the user-item ratings matrix. The algorithm implemen...
Manolis G. Vozalis, Angelos I. Markos, Konstantino...