Sciweavers

161 search results - page 29 / 33
» Algorithms for Sensor Networks: What Is It Good for
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
13 years 9 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin
IPPS
2009
IEEE
14 years 3 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
GLOBECOM
2009
IEEE
14 years 3 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
RAID
2001
Springer
14 years 26 days ago
Probabilistic Alert Correlation
With the growing deployment of host and network intrusion detection systems, managing reports from these systems becomes critically important. We present a probabilistic approach t...
Alfonso Valdes, Keith Skinner