1698 search results - page 329 / 340 » Growing Complex Games |
TIT
2010
14 years 4 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
HPCA
2011
IEEE
14 years 1 months ago
2011
IEEE
As the web becomes the platform of choice for execution of more complex applications, a growing portion of computation is handed off by developers to the client side to reduce net...
101
click to vote
CGF
2011
14 years 1 months ago
2011
High-dimensional data visualization is receiving increasing interest because of the growing abundance of highdimensional datasets. To understand such datasets, visualization of th...
COMSUR
2011
13 years 9 months ago
2011
—In large networks, a data source may not reach the intended sink in a single hop, thereby requiring the traffic to be routed via multiple hops. An optimized choice of such rout...
102
click to vote
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...