7986 search results - page 200 / 1598 » Computational Science and its Applications |
155
click to vote
FOCS
2007
IEEE
16 years 26 days ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
139
click to vote
RTA
2007
Springer
16 years 19 days ago
2007
Springer
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
173
click to vote
RANDOM
1997
Springer
15 years 10 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
172
click to vote
ACMSE
2005
ACM
15 years 8 months ago
2005
ACM
Many networking researches depend on an accurate simulation of network traffic. For example, Intrusion Detection Systems generally require tuning to be effective in each new envir...
205
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
Abstract. We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from...