Sciweavers

1414 search results - page 73 / 283
» Randomness and Universal Machines
Sort
View
ICML
2004
IEEE
14 years 9 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
DSN
2011
IEEE
12 years 8 months ago
Analysis of security data from a large computing organization
In this work, we study security incidents that occurred over period of 5 years at the National Center for Supercomputing Applications at the University of Illinois. The analysis co...
Aashish Sharma, Zbigniew Kalbarczyk, James Barlow,...
FOCS
2008
IEEE
13 years 9 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
CPC
2002
95views more  CPC 2002»
13 years 8 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
ICML
2004
IEEE
14 years 2 months ago
Learning to learn with the informative vector machine
This paper describes an ecient method for learning the parameters of a Gaussian process (GP). The parameters are learned from multiple tasks which are assumed to have been drawn ...
Neil D. Lawrence, John C. Platt