473 search results - page 68 / 95 » Heapable Sequences and Subsequences |
140
click to vote
BMCBI
2011
14 years 9 months ago
2011
Background: In order to interpret the results obtained from a microarray experiment, researchers often shift focus from analysis of individual differentially expressed genes to an...
130
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
155
click to vote
TCAD
2010
14 years 8 months ago
2010
Design debugging is a major bottleneck in modern VLSI design flows as both the design size and the length of the error trace contribute to its inherent complexity. With typical des...
146
click to vote
TON
2012
13 years 4 months ago
2012
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
137
click to vote
ICALP
1997
Springer
15 years 6 months ago
1997
Springer
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...