Sciweavers

1612 search results - page 273 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
IPPS
2008
IEEE
15 years 4 months ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...
ICFP
2004
ACM
15 years 9 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
MOBICOM
2009
ACM
15 years 4 months ago
Data fusion improves the coverage of wireless sensor networks
Wireless sensor networks (WSNs) have been increasingly available for critical applications such as security surveillance and environmental monitoring. An important performance mea...
Guoliang Xing, Rui Tan, Benyuan Liu, Jianping Wang...
DRM
2005
Springer
15 years 3 months ago
Hybrid static-dynamic attacks against software protection mechanisms
Advances in reverse engineering and program analyses have made software extremely vulnerable to malicious host attacks. These attacks typically take the form of intellectual prope...
Matias Madou, Bertrand Anckaert, Bjorn De Sutter, ...
PLDI
2003
ACM
15 years 3 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...