426 search results - page 48 / 86 » Run lengths and liquidity |
ICCAD
2008
IEEE
14 years 6 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
CPM
2001
Springer
14 years 2 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
BMCBI
2011
13 years 1 months ago
2011
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
ICDAR
2011
IEEE
12 years 9 months ago
2011
IEEE
— This paper presents a new method based on Fourier and moments features to extract words and characters from a video text line in any direction for recognition. Unlike existing ...