1060 search results - page 204 / 212 » Notes on Coding Theory |
105
click to vote
MOBICOM
2003
ACM
15 years 2 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
SENSYS
2003
ACM
15 years 2 months ago
2003
ACM
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...
SOFTVIS
2003
ACM
15 years 2 months ago
2003
ACM
Analysis and design of programs by using tools has emerged to a standard technique in object-oriented software engineering. Many of these tools claim to implement methods accordin...
CPM
2001
Springer
15 years 2 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
VISUALIZATION
2000
IEEE
15 years 2 months ago
2000
IEEE
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...