Sciweavers

2100 search results - page 74 / 420
» Fundamentals of the problem
Sort
View
PODS
2012
ACM
276views Database» more  PODS 2012»
12 years 19 days ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
ICIP
2005
IEEE
14 years 12 months ago
Generalized Wiener estimation algorithms based on a family of heavy-tail distributions
A fundamental problem in signal processing is to estimate signal from noisy observations. When some prior information about the statistical models of the signal and noise is avail...
Guang Deng
32
Voted
DAC
1998
ACM
14 years 11 months ago
Policy Optimization for Dynamic Power Management
Dynamic power management schemes (also called policies) can be used to control the power consumption levels of electronic systems, by setting their components in different states,...
Giuseppe A. Paleologo, Luca Benini, Alessandro Bog...
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
14 years 10 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
CEC
2009
IEEE
14 years 5 months ago
When is an estimation of distribution algorithm better than an evolutionary algorithm?
—Despite the wide-spread popularity of estimation of distribution algorithms (EDAs), there has been no theoretical proof that there exist optimisation problems where EDAs perform...
Tianshi Chen, Per Kristian Lehre, Ke Tang, Xin Yao