426 search results - page 32 / 86 » Run lengths and liquidity |
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
To fully exploit multicore processors, applications are expected to provide a large degree of thread-level parallelism. While adequate for low core counts and their typical worklo...
COCOON
2010
Springer
14 years 1 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
JCP
2008
13 years 9 months ago
2008
Multi-pixel encoding is an emerging method in visual cryptography for that it can encode more than one pixel for each encoding run. Nevertheless, in fact its encoding efficiency is...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
BMCBI
2006
13 years 10 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...