1236 search results - page 6 / 248 » Prefix-Like Complexities and Computability in the Limit |
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
RTS
2011
13 years 2 months ago
2011
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
PIMRC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— To protect SIP communication networks from attacks, especially flooding attacks like Denial-of-Service or message spam, Intrusion Detection Systems (IDS) are deployed ...