Sciweavers

2814 search results - page 123 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
115
Voted
SODA
1994
ACM
88views Algorithms» more  SODA 1994»
15 years 3 months ago
Optimal Prediction for Prefetching in the Worst Case
Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because...
P. Krishnan, Jeffrey Scott Vitter
MMSEC
2004
ACM
145views Multimedia» more  MMSEC 2004»
15 years 8 months ago
Improving LSB steganalysis using marginal and joint probabilistic distributions
The goal of steganalysis is to search for the presence of hidden information in numerical contents. This paper is based on a previous LSB steganalysis scheme for digital images th...
Benoit Roue, Patrick Bas, Jean-Marc Chassery
PE
2000
Springer
118views Optimization» more  PE 2000»
15 years 2 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
122
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
Junshan Zhang, Dong Zheng, Mung Chiang
ICML
2010
IEEE
15 years 3 months ago
Finite-Sample Analysis of LSTD
In this paper we consider the problem of policy evaluation in reinforcement learning, i.e., learning the value function of a fixed policy, using the least-squares temporal-differe...
Alessandro Lazaric, Mohammad Ghavamzadeh, Ré...