239 search results - page 28 / 48 » Fast Prefix Code Processing |
BMCBI
2007
13 years 7 months ago
2007
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
EUROSYS
2010
ACM
14 years 4 months ago
2010
ACM
Bugs in concurrent programs are extremely difficult to find and fix during testing. In this paper, we propose Kivati, which can efficiently detect and prevent atomicity violat...
CF
2007
ACM
13 years 11 months ago
2007
ACM
Performance tuning is an important and time consuming task which may have to be repeated for each new application and platform. Although iterative optimisation can automate this p...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
A finite implementation of the ridgelet transform is presented. The transform is invertible, non-redundant and achieved via fast algorithms. Furthermore we show that this transfor...
ICIP
1997
IEEE
14 years 9 months ago
1997
IEEE
In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon ...