2188 search results - page 124 / 438 » Instance-Optimal Geometric Algorithms |
140
Voted
CCCG
2010
15 years 4 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
135
click to vote
CCCG
2003
15 years 4 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
118
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
113
Voted
ICIP
2007
IEEE
15 years 9 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
111
click to vote
ICDAR
2005
IEEE
2005
IEEE
A Two-stage Online Handwritten Chinese Character Segmentation Algorithm Based on Dynamic Programming
15 years 8 months ago
In this paper, an online handwritten Chinese character segmentation method is proposed. It is based on a dynamic programming algorithm, which uses geometrical features extracted f...