5595 search results - page 72 / 1119 » Approximation Algorithms for Clustering Problems |
495
click to vote
ICA
2012
Springer
14 years 7 days ago
2012
Springer
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
146
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
142
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
148
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
145
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...