Sciweavers

7015 search results - page 148 / 1403
» Approximation algorithms for co-clustering
Sort
View
ISAAC
2010
Springer
265views Algorithms» more  ISAAC 2010»
13 years 7 months ago
On the Approximability of the Maximum Interval Constrained Coloring Problem
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...
DEDS
2008
94views more  DEDS 2008»
13 years 9 months ago
Approximate Simulation Relations for Hybrid Systems
Abstract Approximate simulation relations have recently been introduced as a powerful tool for the approximation of discrete and continuous systems. In this paper, we his abstracti...
Antoine Girard, A. Agung Julius, George J. Pappas
JAIR
2011
114views more  JAIR 2011»
13 years 7 days ago
Properties of Bethe Free Energies and Message Passing in Gaussian Models
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
Botond Cseke, Tom Heskes
CORR
2006
Springer
172views Education» more  CORR 2006»
13 years 9 months ago
Approximate Convex Optimization by Online Game Playing
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
Elad Hazan
MOR
2000
90views more  MOR 2000»
13 years 9 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger