8825 search results - page 172 / 1765 » All for one or one for all |
134
click to vote
BIBE
2010
IEEE
14 years 8 months ago
2010
IEEE
The study of compressed storage schemes for highly repetitive sequence collections has been recently boosted by the availability of cheaper sequencing technologies and the flood of...
125
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
129
click to vote
RSA
2011
14 years 8 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
143
click to vote
SEMWEB
2010
Springer
14 years 8 months ago
2010
Springer
The amount of data published on the Semantic Web has witnessed a tremendous growth in the last years to which the Linked Open Data (LOD) project has contributed significantly. Whil...
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—This work considers the joint source-channel problem of transmitting a Gaussian source over a two-user multipleinput multiple-output (MIMO) broadcast channel. We show th...