562 search results - page 105 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
135
click to vote
SSD
2007
Springer
15 years 3 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
CIKM
2003
Springer
15 years 2 months ago
2003
Springer
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
100
click to vote
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
85
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...