Sciweavers

1817 search results - page 344 / 364
» Forcing and Type Theory
Sort
View
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
SACMAT
2006
ACM
14 years 2 months ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
SBCCI
2006
ACM
139views VLSI» more  SBCCI 2006»
14 years 2 months ago
Infrastructure for dynamic reconfigurable systems: choices and trade-offs
Platform-based design is a method to implement complex SoCs, avoiding chip design from scratch. A promising evolution of platform-based design are MPSoC. Such generic architecture...
Leandro Möller, Rafael Soares, Ewerson Carval...
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
14 years 2 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
BIBE
2005
IEEE
121views Bioinformatics» more  BIBE 2005»
14 years 2 months ago
RNA Pseudoknot Prediction Using Term Rewriting
RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in a...
Xuezheng Fu, Hao Wang, William L. Harrison, Robert...