1142 search results - page 108 / 229 » Approximability of Clausal Constraints |
224
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
183
click to vote
ACL
2012
13 years 8 months ago
2012
We argue that multilingual parallel data provides a valuable source of indirect supervision for induction of shallow semantic representations. Specifically, we consider unsupervi...
214
click to vote
COCOS
2003
Springer
15 years 11 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
195
click to vote
MP
2010
15 years 4 months ago
2010
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
262
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...