Sciweavers

770 search results - page 143 / 154
» Dinatural Terms in System F
Sort
View
COMPGEOM
2006
ACM
14 years 2 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
PLDI
2006
ACM
14 years 2 months ago
Refactoring programs to secure information flows
Adding a sound information flow security policy to an existing program is a difficult task that requires major analysis of and changes to the program. In this paper we show how ...
Scott F. Smith, Mark Thober
PODC
2006
ACM
14 years 2 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
SIGCSE
2005
ACM
163views Education» more  SIGCSE 2005»
14 years 2 months ago
Using SeSFJava in teaching introductory network courses
Networking course projects are usually described by an informal specification and a collection of test cases. Students often misunderstand the specification or oversimplify it t...
Tamer Elsharnouby, A. Udaya Shankar
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
14 years 2 months ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter