2479 search results - page 270 / 496 » A Computational Theory of Working Memory |
178
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
192
click to vote
SIGMETRICS
2006
ACM
16 years 17 days ago
2006
ACM
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide e...
170
click to vote
CCA
2005
Springer
16 years 5 days ago
2005
Springer
kind Reals in Abstract Stone Duality Andrej Bauer and Paul Taylor 3 June 2009 Stone Duality (ASD) is a direct axiomatisation of general topology, in contrast to the traditional an...
222
click to vote
ACISP
2006
Springer
16 years 19 days ago
2006
Springer
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
181
click to vote
CASES
2006
ACM
16 years 18 days ago
2006
ACM
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...