Sciweavers

3604 search results - page 56 / 721
» All Common Subsequences
Sort
View
133
Voted
BMCBI
2006
98views more  BMCBI 2006»
15 years 3 months ago
Scanning sequences after Gibbs sampling to find multiple occurrences of functional elements
Background: Many DNA regulatory elements occur as multiple instances within a target promoter. Gibbs sampling programs for finding DNA regulatory elements de novo can be prohibiti...
Kannan Tharakaraman, Leonardo Mariño-Ram&ia...
195
Voted

Book
392views
17 years 1 months ago
Reinforcement Learning: An Introduction
"Reinforcement learning is learning what to do how to map situations to actions so as to maximize a numerical reward signal. The learner is not told which actions to take, as ...
Richard S. Sutton, Andrew G. Barto
242
Voted

Publication
143views
17 years 1 months ago
On Caching out-of-order packets in window flow controlled networks
In window flow controlled networks, if a packet is lost the destination has to decide whether to save (cache) subsequent out-of-order packets. Also, the source has to decide whethe...
R. Jain,
134
Voted
ICIP
2002
IEEE
16 years 5 months ago
Fast text/graphics resolution improvement using wavelet based denoising and chain-code table lookup
We propose a fast text/graphics resolution improvement algorithm with boundary parameterization and wavelet based denoising. Given input images containing labeled text/graphics ob...
Onur G. Guleryuz, Anoop Bhattacharjya
123
Voted
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
15 years 10 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber