5592 search results - page 352 / 1119 » On Random Betweenness Constraints |
189
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
159
click to vote
NIPS
2007
15 years 8 months ago
2007
A semi-supervised multitask learning (MTL) framework is presented, in which M parameterized semi-supervised classifiers, each associated with one of M partially labeled data mani...
133
click to vote
NIPS
2004
15 years 8 months ago
2004
We propose a sequential information maximization model as a general strategy for programming eye movements. The model reconstructs high-resolution visual information from a sequen...
198
click to vote
NIPS
2004
15 years 8 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
187
click to vote
IJCAI
2003
15 years 8 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...