2421 search results - page 89 / 485 » Approximate Flow-Aware Networking |
214
click to vote
OL
2011
15 years 1 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
205
click to vote
IPL
2010
15 years 1 months ago
2010
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
166
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This article provides a central limit theorem for a consistent estimator of the population eigenvalues of a class of sample covariance matrices. An exact expression as well as an ...
141
click to vote
CISS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract— An analytically tractable model for Gaussian multiuser channels with fading is studied, and the capacity region of this model is found to be a good approximation of the...
171
click to vote
WCNC
2010
IEEE
15 years 10 months ago
2010
IEEE
—The performance of a cooperative network with Cooperative Maximal Ratio Combining (C-MRC) is analyzed. To this end, we propose a heuristic approximation to the total received SN...