Sciweavers

1110 search results - page 120 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
MOC
2000
70views more  MOC 2000»
14 years 11 months ago
Extrapolation methods and derivatives of limits of sequences
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
Avram Sidi
PPOPP
1999
ACM
15 years 3 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
72
Voted
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
15 years 11 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
CORR
2006
Springer
76views Education» more  CORR 2006»
14 years 11 months ago
Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
Martin J. Wainwright
ICML
2009
IEEE
15 years 12 months ago
Model-free reinforcement learning as mixture learning
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
Nikos Vlassis, Marc Toussaint