Sciweavers

9176 search results - page 1641 / 1836
» algorithms 2010
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 8 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
15 years 4 months ago
Leader Election Problem versus Pattern Formation Problem
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
Yoann Dieudonné, Franck Petit, Vincent Vill...
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
15 years 10 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Perceptually-motivated Real-time Temporal Upsampling of 3D Content for High-refresh-rate Displays
High-refresh-rate displays (e. g., 120 Hz) have recently become available on the consumer market and quickly gain on popularity. One of their aims is to reduce the perceived blur ...
Piotr Didyk, Elmar Eisemann, Tobias Ritschel, Karo...
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Two-Colored Pixels
In this paper we show how to use two-colored pixels as a generic tool for image processing. We apply twocolored pixels as a basic operator as well as a supporting data structure f...
Darko Pavic and Leif Kobbelt
« Prev « First page 1641 / 1836 Last » Next »