Sciweavers

1647 search results - page 206 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
15 years 2 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
INFOCOM
2007
IEEE
15 years 8 months ago
Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
Zhenzhen Ye, Alhussein A. Abouzeid, Jing Ai
125
Voted
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 3 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
15 years 8 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
128
Voted
WWW
2005
ACM
16 years 3 months ago
The volume and evolution of web page templates
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
David Gibson, Kunal Punera, Andrew Tomkins