1042 search results - page 22 / 209 » Failing First: An Update |
CCS
2006
ACM
15 years 1 months ago
2006
ACM
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
108
click to vote
ANCS
2005
ACM
15 years 3 months ago
2005
ACM
IP address lookup is one of the most challenging problems of Internet routers. In this paper, an IP lookup rate of 263 Mlps (Million lookups per second) is achieved using a novel ...
ACSC
2010
IEEE
14 years 5 months ago
2010
IEEE
The dynamic topological order problem is that of efficiently updating a topological order after some edge(s) are inserted into a graph. Much prior work exists on the unit-change v...
IEEESCC
2008
IEEE
15 years 4 months ago
2008
IEEE
Workflows tend to fail in real-world scenarios due to the uncertain/unreliable sensory information which sometimes needs to be updated during the execution of workflows. In a lo...
DAGSTUHL
2006
14 years 11 months ago
2006
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...