227 search results - page 5 / 46 » Deterministic Sampling Algorithms for Network Design |
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
130
click to vote
ESA
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
104
click to vote
SIGMETRICS
2011
ACM
14 years 7 days ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
CN
1998
14 years 9 months ago
1998
HTTP cache servers reduce network traffic by storing popular files nearer to the client and have been implemented worldwide. Their reported performance on key metrics such as hit ...
ICASSP
2008
IEEE
15 years 3 months ago
2008
IEEE
We address the design and optimization of an energy-efficient lifting-based 2D transform for wireless sensor networks with irregular spatial sampling. The 2D transform is designe...