1964 search results - page 348 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
MCS
2005
Springer
14 years 3 months ago
2005
Springer
Mixed Group Ranks is a parametric method for combining rank based classi ers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
PKDD
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
NIPS
2007
13 years 11 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
FUIN
2010
13 years 8 months ago
2010
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...