1387 search results - page 9 / 278 » Convexity in Discrete Space |
113
Voted
COCOS
2003
Springer
15 years 2 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...
AIPS
2004
14 years 11 months ago
2004
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
72
Voted
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
86
Voted
DGCI
2003
Springer
15 years 2 months ago
2003
Springer
The problem of reconstructing finite subsets of the integer lattice from X-rays has been studied in discrete mathematics and applied in several fields like image processing, data...
70
Voted
GMP
2000
IEEE
15 years 1 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...