Sciweavers

29908 search results - page 5954 / 5982
» On the complexity of communication complexity
Sort
View
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
12 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
SIGECOM
2011
ACM
320views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Market making and mean reversion
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
Tanmoy Chakraborty, Michael Kearns
SIGMOD
2011
ACM
170views Database» more  SIGMOD 2011»
12 years 10 months ago
Warding off the dangers of data corruption with amulet
Occasional corruption of stored data is an unfortunate byproduct of the complexity of modern systems. Hardware errors, software bugs, and mistakes by human administrators can corr...
Nedyalko Borisov, Shivnath Babu, NagaPramod Mandag...
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
12 years 10 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
12 years 10 months ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...
« Prev « First page 5954 / 5982 Last » Next »