1688 search results - page 23 / 338 » The Complexity of Rationalizing Matchings |
SIAMCOMP
2010
13 years 6 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
SIGECOM
2010
ACM
14 years 15 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
SPDP
1990
IEEE
13 years 11 months ago
1990
IEEE
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
FGR
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a novel algorithm for estimating complex human motion from 3D video. We base our algorithm on a model-based approach which uses a complete surface mesh of a 3D...
CPM
1993
Springer
13 years 11 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...