Sciweavers

2214 search results - page 235 / 443
» complexity 2004
Sort
View
OSDI
2004
ACM
16 years 5 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 4 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
PERCOM
2004
ACM
16 years 4 months ago
A Mobility Gateway for Small-Device Networks
Networks of small devices, such as environmental sensors, introduce a number of new challenges for traditional protocols and approaches. In particular, the extreme resource constr...
Robert C. Chalmers, Kevin C. Almeroth
APLAS
2004
ACM
15 years 10 months ago
A Functional Language for Logarithmic Space
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...
Peter Møller Neergaard
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
15 years 10 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn