Sciweavers

13603 search results - page 80 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
TOG
2002
208views more  TOG 2002»
15 years 5 months ago
Video matting of complex scenes
This paper describes a new framework for video matting, the process of pulling a high-quality alpha matte and foreground from a video sequence. The framework builds upon technique...
Yung-Yu Chuang, Aseem Agarwala, Brian Curless, Dav...
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
15 years 4 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
TCOM
2008
127views more  TCOM 2008»
15 years 5 months ago
Low complexity affine MMSE detector for iterative detection-decoding MIMO OFDM systems
Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detecti...
Daniel N. Liu, Michael P. Fitz
PODC
2012
ACM
13 years 8 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
FPCA
1989
15 years 10 months ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl