Sciweavers

1254 search results - page 9 / 251
» Making Hard Problems Harder
Sort
View
SIGCOMM
2010
ACM
13 years 7 months ago
The case for active device drivers
We revisit the device-driver architecture supported by the majority of operating systems, where a driver is a passive object that does not have its own thread of control and is on...
Leonid Ryzhyk, Yanjin Zhu, Gernot Heiser
DATE
2004
IEEE
135views Hardware» more  DATE 2004»
13 years 11 months ago
Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
ESSOS
2010
Springer
14 years 21 days ago
BuBBle: A Javascript Engine Level Countermeasure against Heap-Spraying Attacks
Web browsers that support a safe language such as Javascript are becoming a platform of great interest for security attacks. One such attack is a heap-spraying attack: a new kind o...
Francesco Gadaleta, Yves Younan, Wouter Joosen
STACS
2009
Springer
14 years 2 months ago
Hardness and Algorithms for Rainbow Connectivity
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
13 years 9 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan