7129 search results - page 703 / 1426 » Approximation Algorithms for Treewidth |
217
click to vote
ALGORITHMICA
2011
15 years 2 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
249
click to vote
CVIU
2011
15 years 2 months ago
2011
The medial axis transform is valuable for shape representation as it is complete and captures part structure. However, its exact computation for arbitrary 3D models is not feasibl...
209
click to vote
NETWORKS
2011
15 years 2 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
145
click to vote
SIAMNUM
2010
15 years 2 months ago
2010
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The fi...
189
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--In this paper we investigate the sparsity and recognition capabilities of two approximate Bayesian classification algorithms, the multi-class multi-kernel Relevance Vecto...