563 search results - page 5 / 113 » Computing approximate PSD factorizations |
EOR
2006
14 years 9 months ago
2006
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
ACMACE
2009
ACM
15 years 4 months ago
2009
ACM
We developed Exertainer, a sensor-enabled, interactive running entertainment system to support advanced exercise applications. We designed Exertainer to be used in urban environme...
106
Voted
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
SIAMSC
2008
14 years 9 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...