Sciweavers

4047 search results - page 401 / 810
» The Discrete Basis Problem
Sort
View
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
16 years 7 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
16 years 4 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
Anthony Man-Cho So
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 4 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
16 years 4 months ago
Amplified Hardness of Approximation for VCG-Based Mechanisms
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
Shaddin Dughmi, Hu Fu, Robert Kleinberg
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 years 4 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson