133 search results - page 11 / 27 » Approximating the Minimum Weight Triangulation |
SWAT
2010
Springer
13 years 11 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
IMAMS
2007
13 years 8 months ago
2007
Abstract. In this work we focus on approximations of continuous harmonic functions by discrete harmonic functions based on the discrete Laplacian in a triangulation of a point set....
WDAG
2009
Springer
14 years 1 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
CVPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
NIPS
1996
13 years 8 months ago
1996
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...