Sciweavers

5785 search results - page 116 / 1157
» Approximability of Probability Distributions
Sort
View
109
Voted
DASFAA
2006
IEEE
121views Database» more  DASFAA 2006»
15 years 9 months ago
Distributed Network Querying with Bounded Approximate Caching
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
Badrish Chandramouli, Jun Yang 0001, Amin Vahdat
136
Voted
VTC
2008
IEEE
125views Communications» more  VTC 2008»
15 years 10 months ago
A General Formula for Log-MGF Computation: Application to the Approximation of Log-Normal Power Sum via Pearson Type IV Distribu
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
SPAA
2010
ACM
15 years 8 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
CISS
2008
IEEE
15 years 10 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell
147
Voted
ATAL
2008
Springer
15 years 5 months ago
Approximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
Benito Mendoza García, José M. Vidal