Sciweavers

2168 search results - page 321 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
148
Voted
EUROSYS
2006
ACM
16 years 1 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 4 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
IWCMC
2009
ACM
15 years 10 months ago
Dynamic trust establishment in emergency ad hoc networks
This paper proposes a dynamic trust establishment protocol that enables the nodes of an ad hoc network to establish security associations among each other in a distributed and pee...
Christos A. Papageorgiou, Konstantinos Birkos, Tas...
IEEEPACT
2006
IEEE
15 years 10 months ago
Communist, utilitarian, and capitalist cache policies on CMPs: caches as a shared resource
As chip multiprocessors (CMPs) become increasingly mainstream, architects have likewise become more interested in how best to share a cache hierarchy among multiple simultaneous t...
Lisa R. Hsu, Steven K. Reinhardt, Ravishankar R. I...
SENSYS
2003
ACM
15 years 9 months ago
CODA: congestion detection and avoidance in sensor networks
Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is l...
Chieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbe...