Sciweavers

426 search results - page 64 / 86
» Run lengths and liquidity
Sort
View
IEEESCC
2009
IEEE
13 years 7 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
BIB
2010
103views more  BIB 2010»
13 years 7 months ago
Challenges of sequencing human genomes
Massively parallel sequencing technologies continue to alter the study of human genetics. As the cost of sequencing declines, next-generation sequencing (NGS) instruments and data...
Daniel C. Koboldt, Li Ding, Elaine R. Mardis, Rich...
JDA
2011
90views more  JDA 2011»
13 years 4 months ago
Pattern matching in pseudo real-time
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
Raphaël Clifford, Benjamin Sach
TVLSI
2011
265views more  TVLSI 2011»
13 years 4 months ago
Decoding-Aware Compression of FPGA Bitstreams
Abstract—Bitstream compression is important in reconfigurable system design since it reduces the bitstream size and the memory requirement. It also improves the communication ba...
Xiaoke Qin, Chetan Muthry, Prabhat Mishra
TIT
2010
124views Education» more  TIT 2010»
13 years 4 months ago
On the capacity of the precision-resolution system
Arguably, the most prominent constrained system in storage applications is the (d; k)-run-length limited (RLL) system, where every binary sequence obeys the constraint that every t...
Moshe Schwartz, Jehoshua Bruck