Sciweavers

689 search results - page 125 / 138
» Encapsulation theory fundamentals
Sort
View
RTAS
2008
IEEE
14 years 1 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
BROADNETS
2007
IEEE
14 years 1 months ago
Joint monitoring and routing in wireless sensor networks using robust identifying codes
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, ...
INFOCOM
2007
IEEE
14 years 1 months ago
QoS-Driven Power Allocation Over Parallel Fading Channels With Imperfect Channel Estimations in Wireless Networks
— We propose the quality-of-service (QoS) driven power allocation schemes for parallel fading channels when considering imperfect channel estimations. In particular, the parallel...
Jia Tang, Xi Zhang
EUROCRYPT
2007
Springer
14 years 1 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
PODC
2006
ACM
14 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer