GLOBECOM
2010
IEEE
13 years 2 months ago
2010
IEEE
Most peer-assisted media streaming systems have applied a design philosophy that uses a "mesh" topology of peers: each peer connects to a small number of neighboring peer...
JCNS
2010
13 years 3 months ago
2010
Binocular rivalry occurs when two very different images are presented to the two eyes, but a subject perceives only one image at a given time. A number of computational models for...
TIT
2008
13 years 4 months ago
2008
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
TIT
2008
13 years 4 months ago
2008
Simple methods are shown for correcting bursts of large size and bursts combined with random errors using vector symbols and primarily vector XOR and feedback shift register operat...
IEICET
2007
13 years 4 months ago
2007
In this paper, small sized array configurations with small number of element are investigated. As the antenna size, the diameter less than 3λo is assumed. The investigated config...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
BMCBI
2010
13 years 4 months ago
2010
Background: In many microarray experiments, analysis is severely hindered by a major difficulty: the small number of samples for which expression data has been measured. When one ...
ICASSP
2010
IEEE
13 years 4 months ago
2010
IEEE
—This paper provides a framework for designing space-time codes to take advantage of a small number of feedback bits from the receiver. The new codes are based on circulant matri...
ISMB
1993
13 years 5 months ago
1993
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...