Sciweavers

5056 search results - page 50 / 1012
» Network Coding Theory
Sort
View
JSYML
2008
109views more  JSYML 2008»
13 years 10 months ago
Closed fragments of provability logics of constructive theories
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
Albert Visser
CCR
2006
115views more  CCR 2006»
13 years 10 months ago
Network coding: an instant primer
Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are...
Christina Fragouli, Jean-Yves Le Boudec, Jörg...
ICIP
2008
IEEE
14 years 4 months ago
Design and performance of a novel low-density parity-check code for distributed video coding
Low-density parity-check (LDPC) codes are nowadays one of the hottest topics in coding theory, notably due to their advantages in terms of bit error rate performance and low compl...
João Ascenso, Catarina Brites, Fernando Per...
SENSYS
2003
ACM
14 years 3 months ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
ECOOP
2006
Springer
14 years 2 months ago
codeQuest:  Scalable Source Code Queries with Datalog
Abstract. Source code querying tools allow programmers to explore relations between different parts of the code base. This paper describes such a tool, named CodeQuest. It combines...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor