Sciweavers

1494 search results - page 297 / 299
» Polynomial time algorithms for network information flow
Sort
View
JCST
2010
155views more  JCST 2010»
13 years 2 months ago
Efficient Location Updates for Continuous Queries over Moving Objects
Abstract The significant overhead related to frequent location updates from moving objects often results in poor performance. As most of the location updates do not affect the quer...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
TSP
2010
13 years 2 months ago
On scalable distributed coding of correlated sources
Abstract--This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit, a setting typically encountered in sensor n...
Ankur Saxena, Kenneth Rose
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
WWW
2007
ACM
14 years 8 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
WWW
2007
ACM
14 years 8 months ago
The complex dynamics of collaborative tagging
The debate within the Web community over the optimal means by which to organize information often pits formalized classifications against distributed collaborative tagging systems...
Harry Halpin, Valentin Robu, Hana Shepherd