32 search results - page 4 / 7 » An Extended Semidefinite Relaxation for Satisfiability |
CLIMA
2004
13 years 9 months ago
2004
In this paper we extend the Revision Programming framework--a logic-based framework to express and maintain constraints on knowledge bases-with different forms of preferences. Pref...
PAMI
2011
13 years 2 months ago
2011
—This paper addresses the issue of matching rigid and articulated shapes through probabilistic point registration. The problem is recast into a missing data framework where unkno...
VLDB
1993
ACM
13 years 11 months ago
1993
ACM
Extensions of the traditional atomic transaction model are needed to support the development of multi-system applications or work ows that access heterogeneous databases and legac...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
COLT
2003
Springer
14 years 21 days ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...