4843 search results - page 121 / 969 » The Shortcut Problem - Complexity and Approximation |
127
click to vote
CVPR
1998
IEEE
16 years 5 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
137
click to vote
SARA
2009
Springer
15 years 9 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
119
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
130
click to vote
CCCG
1998
15 years 4 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
128
Voted
SIAMSC
2008
15 years 3 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...