Sciweavers

1717 search results - page 293 / 344
» A Computable Spectral Theorem
Sort
View
83
Voted
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
15 years 6 months ago
Minimum Entropy Coloring
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
IMC
2004
ACM
15 years 6 months ago
Identifying elephant flows through periodically sampled packets
Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also ver...
Tatsuya Mori, Masato Uchida, Ryoichi Kawahara, Jia...
79
Voted
CCS
2004
ACM
15 years 6 months ago
Verifying policy-based security for web services
WS-SecurityPolicy is a declarative configuration language for driving web services security mechanisms. We describe a formal sefor WS-SecurityPolicy, and propose a more abstract ...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
CONCUR
2004
Springer
15 years 5 months ago
Type Based Discretionary Access Control
Abstract. Discretionary Access Control (DAC) systems provide powerful mechanisms for resource management based on the selective distribution of capabilities to selected classes of ...
Michele Bugliesi, Dario Colazzo, Silvia Crafa
CONCUR
2004
Springer
15 years 5 months ago
Probabilistic Event Structures and Domains
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
Daniele Varacca, Hagen Völzer, Glynn Winskel