Sciweavers

21108 search results - page 42 / 4222
» A General Class of Models of
Sort
View
ICDM
2008
IEEE
97views Data Mining» more  ICDM 2008»
14 years 2 months ago
Semi-supervised Learning from General Unlabeled Data
We consider the problem of Semi-supervised Learning (SSL) from general unlabeled data, which may contain irrelevant samples. Within the binary setting, our model manages to better...
Kaizhu Huang, Zenglin Xu, Irwin King, Michael R. L...
COCOON
2007
Springer
14 years 1 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
COR
2007
163views more  COR 2007»
13 years 7 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
SIGSOFT
2010
ACM
13 years 5 months ago
An effective dynamic analysis for detecting generalized deadlocks
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 7 months ago
MDL Convergence Speed for Bernoulli Sequences
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total...
Jan Poland, Marcus Hutter