27 search results - page 5 / 6 » Convex Recoloring Revisited: Complexity and Exact Algorithms |
MP
2008
13 years 4 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
CORR
2012
Springer
12 years 16 days ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
SIGMETRICS
2008
ACM
13 years 4 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
TIT
2010
12 years 11 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...