688 search results - page 111 / 138 » General Partitioning on Random Graphs |
154
click to vote
AINA
2007
IEEE
15 years 11 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
149
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
196
click to vote
WIDM
2004
ACM
15 years 10 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
149
Voted
TOC
2008
15 years 5 months ago
2008
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
177
click to vote
TIT
2010
14 years 11 months ago
2010
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...