5595 search results - page 237 / 1119 » Approximation Algorithms for Clustering Problems |
182
click to vote
IPL
2002
15 years 6 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
165
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
187
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper we describe an approach that uses a combination of visual and audio features to cluster shots belonging to the same person together in video programs. We use color h...
178
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
162
Voted
JC
2007
15 years 6 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...