Sciweavers

1356 search results - page 162 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 4 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
NIPS
2007
13 years 10 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
VLDB
1987
ACM
108views Database» more  VLDB 1987»
14 years 13 days ago
Translating and Optimizing SQL Queries Having Aggregates
is at least ae powerful as SQL. Two well known relational query languages that have a sound theoretical foundation are relational algebra and relational calculus. As SQL is more cl...
Günter von Bültzingsloewen
SIGMETRICS
2000
ACM
144views Hardware» more  SIGMETRICS 2000»
13 years 8 months ago
Bistro: a framework for building scalable wide-area Upload applications
Hot spots are a major obstacle to achieving scalability in the Internet. At the application layer, hot spots are usually caused by either (a) high demand for some data or (b) high...
Samrat Bhattacharjee, William C. Cheng, Cheng-Fu C...
ATAL
2005
Springer
14 years 2 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson