3244 search results - page 36 / 649 » On convex complexity measures |
CCE
2010
14 years 8 months ago
2010
The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based...
TCS
2010
14 years 6 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
IWVF
2001
Springer
15 years 3 months ago
2001
Springer
A method for partitioning shapes is described based on a global convexity measure. Its advantages are that its global nature makes it robust to noise, and apart from the number of ...
COMPGEOM
1991
ACM
15 years 2 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...