16 search results - page 1 / 4 » The Extent of Constructive Game Labellings |
LOGCOM
2007
13 years 4 months ago
2007
We define a notion of combinatorial labellings, and show that ∆0 2 is the largest boldface pointclass in which every set admits a combinatorial labelling.
ICDM
2003
IEEE
13 years 9 months ago
2003
IEEE
Semi-supervised learning methods construct classifiers using both labeled and unlabeled training data samples. While unlabeled data samples can help to improve the accuracy of trai...
KCAP
2005
ACM
13 years 10 months ago
2005
ACM
Our ongoing work aims at defining an ontology-centered approach for building expertise models for the CommonKADS methodology. This approach (which is named "OntoKADS") i...
APPROX
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
WWW
2009
ACM
13 years 11 months ago
2009
ACM
Geographical context is very important for images. Millions of images on the Web have been already assigned latitude and longitude information. Due to the rapid proliferation of s...