92 search results - page 5 / 19 » On Maximal S-Free Convex Sets |
WADS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
IWCIA
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
112
click to vote
NIPS
2001
14 years 11 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
73
Voted
TCOM
2008
14 years 9 months ago
2008
In order to reduce the inter-carrier interference (ICI) produced by frequency offset in OFDM systems, we set up an optimization problem to find the transmission pulse which maximi...
91
Voted
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...