6575 search results - page 663 / 1315 » Specializing visualization algorithms |
220
click to vote
PODC
2006
ACM
16 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
193
Voted
COLT
2004
Springer
16 years 24 days ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
198
Voted
JAL
2006
15 years 7 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
197
click to vote
TIP
2008
15 years 7 months ago
2008
Abstract--We propose an algorithm for designing linear equalizers that maximize the structural similarity (SSIM) index between the reference and restored signals. The SSIM index ha...
214
Voted
MOR
2010
15 years 5 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...