Sciweavers

1383 search results - page 199 / 277
» An Evaluation Methodology for Computational Grids
Sort
View
IPPS
1998
IEEE
15 years 10 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
SCN
2010
Springer
122views Communications» more  SCN 2010»
15 years 4 months ago
Recursive Lattice Reduction
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
Thomas Plantard, Willy Susilo
CVPR
2001
IEEE
16 years 8 months ago
A Nonparametric Statistical Comparison of Principal Component and Linear Discriminant Subspaces for Face Recognition
The FERET evaluation compared recognition rates for different semi-automated and automated face recognition algorithms. We extend FERET by considering when differences in recognit...
J. Ross Beveridge, Kai She, Bruce A. Draper, Geof ...
ICCV
1999
IEEE
16 years 8 months ago
Prediction Error as a Quality Metric for Motion and Stereo
This paper presents a new methodology for evaluating the quality of motion estimation and stereo correspondence algorithms. Motivated by applications such as novel view generation...
Richard Szeliski
ICPR
2006
IEEE
16 years 7 months ago
Precision-recall operating characteristic (P-ROC) curves in imprecise environments
Traditionally, machine learning algorithms have been evaluated in applications where assumptions can be reliably made about class priors and/or misclassification costs. In this pa...
Thomas Landgrebe, Pavel Paclík, Robert P. W...