3134 search results - page 583 / 627 » simulation 2010 |
104
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we study the problem of recovering a low-rank matrix (the principal components) from a highdimensional data matrix despite both small entry-wise noise and gross spar...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
: In this paper we propose two analytically tractable stochastic models of non-slotted Aloha for Mobile Ad-hoc NETworks (MANETs): one model assumes a static pattern of nodes while ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...