972 search results - page 30 / 195 » Performance of data networks with random links |
158
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...
156
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K...
161
click to vote
IWCMC
2010
ACM
15 years 11 months ago
2010
ACM
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
174
click to vote
ICDCSW
2008
IEEE
16 years 13 days ago
2008
IEEE
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
163
click to vote
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...