5966 search results - page 319 / 1194 » Distributed Caching Algorithms for Content Distribution Netw... |
139
Voted
SIAMCOMP
2000
15 years 3 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
140
click to vote
ICS
1999
Tsinghua U.
15 years 7 months ago
1999
Tsinghua U.
—This paper explores the use of compiler optimizations which optimize the layout of instructions in memory. The target is to enable the code to make better use of the underlying ...
139
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
104
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
In the information regularization framework by Corduneanu and Jaakkola (2005), the distributions of labels are propagated on a hypergraph for semi-supervised learning. The learnin...
109
click to vote
ISCAS
2002
IEEE
15 years 8 months ago
2002
IEEE
The paper discusses State Space Blind Source Recovery (BSR) for minimum phase and non-minimum phase mixtures of gaussian and non-gaussian distributions. The State Space Natural Gr...