5595 search results - page 321 / 1119 » Approximation Algorithms for Clustering Problems |
160
click to vote
APPROX
2004
Springer
16 years 3 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
171
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
173
click to vote
COLOGNETWENTE
2008
15 years 8 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
164
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
161
click to vote
IJAR
2006
15 years 6 months ago
2006
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...