Sciweavers

95 search results - page 8 / 19
» ccr 2004
Sort
View
CCR
2004
79views more  CCR 2004»
13 years 9 months ago
A case for run-time adaptation in packet processing systems
Most packet processing applications receive and process multiple types of packets. Today, the processors available within packet processing systems are allocated to packet types a...
Ravi Kokku, Taylor L. Riché, Aaron R. Kunze...
CCR
2004
62views more  CCR 2004»
13 years 9 months ago
Summary-based routing for content-based event distribution networks
Providing scalable distributed Web-based eventing services has been an important research topic. It is desirable to have an effective mechanism for the servers to summarize their f...
Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Ac...
OOPSLA
2004
Springer
14 years 3 months ago
Finding and preventing run-time error handling mistakes
It is difficult to write programs that behave correctly in the presence of run-time errors. Existing programming language features often provide poor support for executing clean-u...
Westley Weimer, George C. Necula
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 10 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
POPL
2004
ACM
14 years 10 months ago
A type system for well-founded recursion
In the interest of designing a recursive module extension to ML that is as simple and general as possible, we propose a novel type system for general recursion over effectful expr...
Derek Dreyer