Sciweavers

715 search results - page 135 / 143
» A Sampling Data Stream Algorithm For Wireless Sensor Network...
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 7 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
GLOBECOM
2009
IEEE
14 years 2 months ago
A Suboptimal Network Utility Maximization Approach for Scalable Multimedia Applications
—Wired and wireless data networks have witnessed an explosive growth of inelastic traffics such as real-time or media streaming applications. Recently, applications relying on l...
Mohammad Sadegh Talebi, Ahmad Khonsari, Mohammad H...
SIGCOMM
2009
ACM
14 years 2 months ago
Every microsecond counts: tracking fine-grain latencies with a lossy difference aggregator
Many network applications have stringent end-to-end latency requirements, including VoIP and interactive video conferencing, automated trading, and high-performance computing—wh...
Ramana Rao Kompella, Kirill Levchenko, Alex C. Sno...
GIS
2005
ACM
14 years 8 months ago
Monitoring dynamic spatial fields using responsive geosensor networks
Information about dynamic spatial fields, such as temperature, windspeed, or the concentration of gas pollutant in the air, is important for many environmental applications. At th...
Matt Duckham, Silvia Nittel, Michael F. Worboys
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 7 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...