Sciweavers

2001 search results - page 350 / 401
» An Update on Generalized Information Theory
Sort
View
SIGCSE
2004
ACM
141views Education» more  SIGCSE 2004»
14 years 1 months ago
Running on the bare metal with GeekOS
Undergraduate operating systems courses are generally taught e of two approaches: abstract or concrete. In the approach, students learn the concepts underlying operating systems t...
David Hovemeyer, Jeffrey K. Hollingsworth, Bobby B...
IPPS
2000
IEEE
14 years 3 days ago
Connectivity Models for Optoelectronic Computing Systems
Abstract. Rent's rule and related concepts of connectivity such as dimensionality, line-length distributions, and separators have found great use in fundamental studies of di ...
Haldun M. Özaktas
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 11 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CCS
2006
ACM
13 years 11 months ago
Resiliency policies in access control
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
Ninghui Li, Mahesh V. Tripunitara, Qihua Wang