Sciweavers

761 search results - page 93 / 153
» The art of multiprocessor programming
Sort
View
ICML
2010
IEEE
15 years 27 days 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 ...
ICALP
2011
Springer
14 years 3 months ago
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
Silvia Crafa, Francesco Ranzato
IWMM
2011
Springer
204views Hardware» more  IWMM 2011»
14 years 2 months ago
Multicore garbage collection with local heaps
In a parallel, shared-memory, language with a garbage collected heap, it is desirable for each processor to perform minor garbage collections independently. Although obvious, it i...
Simon Marlow, Simon L. Peyton Jones
JMLR
2012
13 years 2 months ago
Transductive Learning of Structural SVMs via Prior Knowledge Constraints
Reducing the number of labeled examples required to learn accurate prediction models is an important problem in structured output prediction. In this paper we propose a new transd...
Chun-Nam Yu
JMLR
2012
13 years 2 months ago
Bayesian Comparison of Machine Learning Algorithms on Single and Multiple Datasets
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
Alexandre Lacoste, François Laviolette, Mar...