Sciweavers

2254 search results - page 105 / 451
» Computing the minimal covering set
Sort
View
130
Voted
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
15 years 5 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi
ICDCS
2007
IEEE
15 years 4 months ago
uSense: A Unified Asymmetric Sensing Coverage Architecture for Wireless Sensor Networks
As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide vario...
Yu Gu, Joengmin Hwang, Tian He, David Hung-Chang D...
110
Voted
IMC
2010
ACM
14 years 10 months ago
Primitives for active internet topology mapping: toward high-frequency characterization
Current large-scale topology mapping systems require multiple days to characterize the Internet due to the large amount of probing traffic they incur. The accuracy of maps from ex...
Robert Beverly, Arthur Berger, Geoffrey G. Xie
IPPS
2006
IEEE
15 years 6 months ago
A nonself space approach to network anomaly detection
The paper presents an approach for the anomaly detection problem based on principles of immune systems. Flexibility and efficiency of the anomaly detection system are achieved by ...
Marek Ostaszewski, Franciszek Seredynski, Pascal B...
94
Voted
CCCG
2007
15 years 2 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta