3204 search results - page 521 / 641 » The b-chromatic Number of a Graph |
167
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
172
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
152
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
161
click to vote
SIGSOFT
2006
ACM
16 years 7 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
263
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...