Sciweavers

510 search results - page 58 / 102
» Runtime Prediction of Real Programs on Real Machines
Sort
View
HPCN
1997
Springer
15 years 8 months ago
Performance Evaluation of HPCN Applications
The performance attained by parallel programs executed on multiprocessor systems is largely in uenced both by the characteristics of the code and by those of the system architectu...
Alessandro P. Merlo
COCO
2006
Springer
113views Algorithms» more  COCO 2006»
15 years 7 months ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...
ICML
2010
IEEE
15 years 5 months ago
Robust Formulations for Handling Uncertainty in Kernel Matrices
We study the problem of uncertainty in the entries of the Kernel matrix, arising in SVM formulation. Using Chance Constraint Programming and a novel large deviation inequality we ...
Sahely Bhadra, Sourangshu Bhattacharya, Chiranjib ...
127
Voted
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
15 years 11 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
ECML
2007
Springer
15 years 10 months ago
Avoiding Boosting Overfitting by Removing Confusing Samples
Boosting methods are known to exhibit noticeable overfitting on some datasets, while being immune to overfitting on other ones. In this paper we show that standard boosting algorit...
Alexander Vezhnevets, Olga Barinova