2137 search results - page 335 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
130
Voted
UAI
2008
15 years 4 months ago
2008
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
154
Voted
ML
2008
ACM
15 years 2 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
114
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
108
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
121
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...