Sciweavers

2125 search results - page 287 / 425
» On Graph Complexity
Sort
View
OSDI
2004
ACM
15 years 10 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...
DCC
2006
IEEE
15 years 9 months ago
Joint Source-Channel Decoding of Multiple Description Quantized Markov Sequences
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
Xiaolin Wu, Xiaohan Wang
99
Voted
ICWS
2008
IEEE
14 years 11 months ago
Generalized Semantics-Based Service Composition
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization's us...
Srividya Kona, Ajay Bansal, M. Brian Blake, Gopal ...
APVIS
2008
14 years 11 months ago
Dynamic Shader Generation for Flexible Multi-Volume Visualization
Volume rendering of multiple intersecting volumetric objects is a difficult visualization task, especially if different rendering styles need to be applied to the components, in o...
Friedemann Rößler, Ralf P. Botchen, Tho...
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
15 years 3 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