The filter-placement problem and its application to minimizing information multiplicity

Proceedings of the VLDB Endowment

Volumn 5, Issue 5, 2012, Pages 418-429

  Erd̈os, D́ora ^a   Ishakian, Vatche ^a   Lapets, Andrei ^a   Terzi, Evimaria ^a   Bestavros, Azer ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; BANDPASS FILTERS; COMBINATORIAL OPTIMIZATION; INFORMATION SERVICES; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SENSOR NETWORKS; SENSOR NODES;

COMBINATORIAL OPTIMIZATION PROBLEMS; DATA DISSEMINATION; EXTENSIVE SIMULATIONS; INFORMATION NETWORKS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; PROCESSING OVERHEAD; REAL-WORLD INFORMATION; UTILITY OF INFORMATION;

INFORMATION FILTERING;

EID: 84863749971     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2140436.2140439     Document Type: Article

References (31)

1. J. Aspnes, K. Chang, and A. Yampolskiy. Inoculation strategies for victims of viruses and the sum-of-squares partition problem. In YALEU/DCS/TR-1295, 2004.
2. U. Brandes. On variants of shortest-path betweenness centrality and their generic computation. Social Networks, 30(2):136 - 145, 2008.
3. K.-P. Chan and A. W. Chee Fu. Efficient time series matching by wavelets. In ICDE, pages 126-133, 1999.
4. G. Chatzimilioudis, H. Hakkoymaz, N. Mamoulis, and D. Gunopulos. Operator placement for snapshot multi-predicate queries in wireless sensor networks. In IEEE MDM '09, pages 21-30, 2009.
5. S. Ching S. Cheung and A. Zakhor. Efficient video similarity measurement with video signature. IEEE TCSVT, 13:59-74, 2003.
6. K. Dasgupta, K. Kalpakis, and P. Namjoshi. An efficient clustering-based heuristic for data gathering and aggregation in sensor networks. In IEEE WCNC, pages 1948-1953, 2003.
7. P. Domingos and M. Richardson. Mining the network value of customers. In 7th ACM SIGKDD, 2001.
8. D. Erlenkotter. A dual-based procedure for uncapacitated facility location. Operations Research, 26(6):992-1009, 1978.
9. C. Frank and K. R̈omer. Distributed facility location algorithms for flexible configuration of wireless sensor networks. In IEEE DCOSS, pages 124-141, 2007.
10. A. Goel and D. Estrin. Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. In SODA '03, pages 499-505, 2003.
11. J. Goldberg, B. Libai, and E. Muller. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters, 12(3):211-223, 2001.
12. J. Heidemann, F. Silva, C. Intanagonwiwat, R. Govindan, D. Estrin, and D. Ganesan. Building efficient wireless sensor networks with low-level naming. SOSP '01, pages 146-159, 2001.
13. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence throw a social network. In ACM SIGKDD, pages 137-146, 2003.
14. A. Krause and C. Guestrin. Near-optimal observation selection using submodular functions. In AAAI, pages 1650-1654, 2007.
15. B. Krishnamachari, D. Estrin, and S. Wicker. The impact of data aggregation in wireless sens or networks. ICDCSW, page 575, 2002.
16. H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In ACM WWW '10, pages 591-600, 2010.
17. J. Leskovec, L. Backstrom, and J. Kleinberg. Meme-tracking and the dynamics of the news cycle. In 15th ACM SIGKDD, pages 497-506, 2009.
18. J. Leskovec, A. Krause, C.Guestrin, C.Faloutsos, J. Van Briesen, and N.Glance. Cost-effective outbreak detection in networks. In ACM SIGKDD, 2007.
19. H. Luo, Y. Liu, and S. K. Das. Distributed algorithm for en route aggregation decision in wireless sensor networks. IEEE TMC 2002.
20. P. Mirchandani, R. Francis, et al. Discrete location theory, volume 504. Wiley New York, 1990.
21. H. Morcos, G. Atia, A. Bestavros, and A. Matta. An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors. In IEEE/ACM DCOSS, 2008.
22. H. Morcos, A. Bestavros, and A. Matta. Amorphous Placement and Informed Diffusion for Timely Field Monitoring by Autonomous, Resource-Constrained, Mobile Sensors. In IEEE SECON, 2008.
23. H. Morcos, A. Bestavros, and I. Matta. Preferential Field Coverage Through Detour-Based Mobility Coordination. In IFIP/IEEE Med-Hoc-Net, 2010.
24. T. Moscibroda and R. Wattenhofer. Facility location: distributed approximation. In ACM PODC, 2005.
25. A. Natsev, R. Rastogi, and K. Shim. Walrus: A similarity retrieval algorithm for image databases. In IEEE TKDE, pages 395-406, 1999.
26. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of approximations for maximizing submodular set functions. Math. Prog., 14:265-294, 1978.
27. R. Pastor-Satorras and A. Vespignani. Immunization of complex networks. Physical Reviews E, 65:1-8, 2002.
28. M. Potamias, F. Bonchi, C. Castillo, and A. Gionis. Fast shortest path distance estimation in large networks. In CIKM, pages 867-876, 2009.
29. O. Rader, W. Gudat, C. Carbone, E. Vescovo, S. Bl̈ugel, R. Kl̈asges, W. Eberhardt, M. Wuttig, J. Redinger, and F. J. Himpsel. Electronic structure of two-dimensional magnetic alloys:c(2x2) mn on cu(100) and ni(100). Phys. Rev. B, 55(8):5404-5415, 1997.
30. M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In 8th ACM SIGKDD, pages 61-70, 2002.
31. B. Williams and T. Camp. Comparison of broadcasting techniques for mobile ad hoc networks. In MobiHoc '02, pages 194-205, 2002.