Sciweavers

791 search results - page 26 / 159
» Approximating the Maximum Sharing Problem
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
PERCOM
2006
ACM
14 years 7 months ago
Maximum Weighted Matching with Interference Constraints
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar
ISITA
2010
13 years 5 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
13 years 7 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
DAM
2011
13 years 2 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz