895 search results - page 34 / 179 » Approximate convex decomposition |
139
click to vote
SIAMJO
2010
15 years 16 days ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
181
Voted
IJON
2007
15 years 5 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
131
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
142
click to vote
IWVF
2001
Springer
15 years 10 months ago
2001
Springer
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
192
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...