Sciweavers

3708 search results - page 82 / 742
» Approximating Betweenness Centrality
Sort
View
ICDCS
2007
IEEE
15 years 4 months ago
Optimizing Multicast Performance in Large-Scale WLANs
Support for efficient multicasting in WLANs can enable new services such as streaming TV channels, radio channels, and visitor's information. With increasing deployments of l...
Ai Chen, Dongwook Lee, Prasun Sinha
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 11 months ago
Distributed Detection over Time Varying Networks: Large Deviations Analysis
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
Dragana Bajovic, Dusan Jakovetic, João Xavi...
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
15 years 7 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
ICNP
2006
IEEE
15 years 6 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
105
Voted
WEA
2005
Springer
117views Algorithms» more  WEA 2005»
15 years 6 months ago
Vertex Cover Approximations: Experiments and Observations
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
Eyjolfur Asgeirsson, Clifford Stein