1439 search results - page 125 / 288 » Fast approximation of centrality |
125
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
147
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
123
Voted
ICNP
2006
IEEE
15 years 9 months ago
2006
IEEE
—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...
104
Voted
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
We use segmentations to match images by shape. To address the unreliability of segmentations, we give a closed form approximation to an average over all segmentations. Our techniqu...
135
click to vote
ICCCN
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...