9 search results - page 2 / 2 » SAT Algorithms for Colouring Some Special Classes of Graphs:... |
JMLR
2006
13 years 5 months ago
2006
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
TSMC
2010
13 years 15 hour ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
ICFP
2008
ACM
14 years 5 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...