Sciweavers

8728 search results - page 1334 / 1746
» On Reduct Construction Algorithms
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Beyond the point cloud: from transductive to semi-supervised learning
Due to its occurrence in engineering domains and implications for natural learning, the problem of utilizing unlabeled data is attracting increasing attention in machine learning....
Vikas Sindhwani, Partha Niyogi, Mikhail Belkin
189
Voted
ICML
2004
IEEE
16 years 7 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
ICML
2004
IEEE
16 years 7 months ago
Utile distinction hidden Markov models
This paper addresses the problem of constructing good action selection policies for agents acting in partially observable environments, a class of problems generally known as Part...
Daan Wierstra, Marco Wiering
200
Voted
ICML
2003
IEEE
16 years 7 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
193
Voted
COORDINATION
2009
Springer
16 years 7 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
« Prev « First page 1334 / 1746 Last » Next »