Sciweavers

242 search results - page 47 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
KAIS
2011
129views more  KAIS 2011»
13 years 1 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
ROBOCOMM
2007
IEEE
14 years 22 days ago
Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
Marco Pavone, Nabhendra Bisnik, Emilio Frazzoli, V...
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 9 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
IPSN
2010
Springer
13 years 11 months ago
Ear-phone: an end-to-end participatory urban noise mapping system
A noise map facilitates monitoring of environmental noise pollution in urban areas. It can raise citizen awareness of noise pollution levels, and aid in the development of mitigat...
Rajib Kumar Rana, Chun Tung Chou, Salil S. Kanhere...
TKDE
2012
199views Formal Methods» more  TKDE 2012»
11 years 8 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang