1972 search results - page 360 / 395 » connection 2008 |
107
click to vote
SIAMCOMP
1998
15 years 10 days ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
122
Voted
SIAMCOMP
1998
15 years 10 days ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
115
Voted
SIAMDM
1998
15 years 10 days ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
91
Voted
TIT
1998
15 years 10 days ago
1998
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
134
Voted
TIT
1998
15 years 10 days ago
1998
In this article we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory in the case of Gaussian...