7133 search results - page 1102 / 1427 » Communication algorithms with advice |
230
click to vote
SPE
2008
15 years 7 months ago
2008
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...
202
click to vote
TII
2008
15 years 7 months ago
2008
In distributed real-time systems, meeting the real-time constraints is mandatory but the satisfaction of other application-dependent criteria is most generally required as well. I...
197
click to vote
TIT
2008
15 years 7 months ago
2008
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
209
click to vote
TKDE
2008
15 years 7 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
213
click to vote
JCM
2007
15 years 7 months ago
2007
Abstract— Wavelength is one of the most important resources in Wavelength Division Multiplexing(WDM) networks. In optical routing, we are given a set of communication paths (or l...