909 search results - page 113 / 182 » On the approximability of some network design problems |
214
click to vote
TKDE
2012
13 years 8 months ago
2012
— 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...
193
click to vote
IPSN
2007
Springer
16 years 13 days ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
174
click to vote
JDA
2006
15 years 6 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
186
click to vote
JIPS
2010
15 years 1 months ago
2010
Secure routing is vital to the acceptance and use of Wireless Sensor Networks (WSN) for many applications. However, providing secure routing in WSNs is a challenging task due to th...
183
Voted
CEAS
2005
Springer
15 years 8 months ago
2005
Springer
Human interaction proofs (HIPs) have become commonplace on the internet for protecting free online services from abuse by automated scripts/bots. They are challenges designed to b...