426 search results - page 44 / 86 » Run lengths and liquidity |
TMI
2008
13 years 9 months ago
2008
A fast and simple algorithm for designing time-optimal waveforms is presented. The algorithm accepts a given arbitrary multi-dimensional k-space trajectory as the input and outputs...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The emergence of new higher education institutions has created the competition in higher education market, and data warehouse can be used as an effective technology tools for incr...
SODA
2010
ACM
13 years 8 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
RECOMB
2010
Springer
13 years 7 months ago
2010
Springer
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
ERSA
2009
13 years 7 months ago
2009
- The FPGA (re)configuration is a time-consuming process and a bottleneck in FPGA-based Run-Time Reconfigurable (RTR) systems. In this paper, we present a High Level Synthesis (HLS...