Sciweavers

147 search results - page 24 / 30
» Algorithms for Computing the Longest Parameterized Common Su...
Sort
View
91
Voted
CVPR
2008
IEEE
16 years 1 months ago
Superpixel lattices
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Ideally, every pixel within each superpixel region will be...
Alastair P. Moore, Simon Prince, Jonathan Warrell,...
ISVC
2010
Springer
14 years 10 months ago
How to Overcome Perceptual Aliasing in ASIFT?
SIFT is one of the most popular algorithms to extract points of interest from images. It is a scale+rotation invariant method. As a consequence, if one compares points of interest ...
Nicolas Noury, Frédéric Sur, Marie-O...
PPOPP
2005
ACM
15 years 5 months ago
Automated type-based analysis of data races and atomicity
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose at run-time. This motivated the development of type systems that statically en...
Amit Sasturkar, Rahul Agarwal, Liqiang Wang, Scott...
DNA
2007
Springer
106views Bioinformatics» more  DNA 2007»
15 years 3 months ago
Hardware Acceleration for Thermodynamic Constrained DNA Code Generation
Reliable DNA computing requires a large pool of oligonucleotides that do not produce cross-hybridize. In this paper, we present a transformed algorithm to calculate the maximum wei...
Qinru Qiu, Prakash Mukre, Morgan Bishop, Daniel J....
BMCBI
2007
233views more  BMCBI 2007»
14 years 11 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong