2183 search results - page 103 / 437 » Multi-pass geometric algorithms |
146
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
144
Voted
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
176
Voted
WAOA
2010
Springer
15 years 2 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
168
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
145
Voted
GEOINFORMATICA
1998
15 years 4 months ago
1998
The nature of map generalization may be non-uniform along the length of an individual line, requiring the application of methods that adapt to the local geometry and the geographi...