Sciweavers

248 search results - page 43 / 50
» Geometrical Probability Covering Algorithm
Sort
View
DCC
2007
IEEE
14 years 7 months ago
Low-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...
ICPP
2009
IEEE
14 years 2 months ago
Run to Potential: Sweep Coverage in Wireless Sensor Networks
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
Min Xi, Kui Wu, Yong Qi, Jizhong Zhao, Yunhao Liu,...
TMC
2008
127views more  TMC 2008»
13 years 7 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
AAAI
2000
13 years 8 months ago
Recognizing End-User Transactions in Performance Management
Providing good quality of service (e.g., low response times) in distributed computer systems requires measuring enduser perceptions of performance. Unfortunately, such measures ar...
Joseph L. Hellerstein, T. S. Jayram, Irina Rish
FOCS
2002
IEEE
14 years 9 days ago
Low-Dimensional Linear Programming with Violations
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
Timothy M. Chan