92 search results - page 6 / 19 » On Maximal S-Free Convex Sets |
214
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
162
click to vote
ISNN
2005
Springer
15 years 11 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
202
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
140
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
176
click to vote
PKDD
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. In content-based image retrieval (CBIR) and image screening, it is often desirable to locate the regions of interest (ROI) in the images automatically. This can be accomp...