17951 search results - page 3211 / 3591 » Network Coding Applications |
165
click to vote
CC
2002
Springer
15 years 6 months ago
2002
Springer
We present an efficient online subpath profiling algorithm, OSP, that reports hot subpaths executed by a program in a given run. The hot subpaths can start at arbitrary basic block...
171
click to vote
COMPUTER
2002
15 years 6 months ago
2002
ion, so mapping between GUI events and the underlying code is not straightforward. Code-based coverage criteria do not necessarily address problematic interactions between the GUI&...
202
click to vote
NJC
2000
15 years 6 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
205
Voted
IJCV
2002
15 years 6 months ago
2002
Current vision systems are designed to perform in clear weather. Needless to say, in any outdoor application, there is no escape from "bad" weather. Ultimately, computer ...
150
click to vote
TIT
1998
15 years 6 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...