291 search results - page 36 / 59 » Approximate centerpoints with proofs |
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
DC
2008
13 years 10 months ago
2008
This paper introduces solo-valency, a variation on the valency proof technique originated by Fischer, Lynch, and Paterson. The new technique focuses on critical events that influe...
ICML
2009
IEEE
14 years 11 months ago
2009
IEEE
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
DCC
2002
IEEE
14 years 10 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...