Sciweavers

5964 search results - page 325 / 1193
» A theory of speculative computation
Sort
View
247
Voted
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 10 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
179
Voted
ICPR
2006
IEEE
16 years 8 months ago
Estimating the location of illuminants in realist master paintings Computer image analysis addresses a debate in art history of
In cast-shadow analysis one merely draws a line between each occluder and its associated shadow cast onto a different surface, possibly with wedges indicating precision. In some c...
MICCAI
2009
Springer
16 years 8 months ago
A Riemannian Framework for Orientation Distribution Function Computing
Compared with Diffusion Tensor Imaging (DTI), High Angular Resolution Imaging (HARDI) can better explore the complex microstructure of white matter. Orientation Distribution Functi...
Jian Cheng, Aurobrata Ghosh, Tianzi Jiang, Rachid ...
190
Voted
IPPS
2007
IEEE
16 years 1 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
16 years 8 days ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek