Sciweavers

81 search results - page 14 / 17
» Repetition-free longest common subsequence
Sort
View
DAC
2004
ACM
14 years 24 days ago
Area-efficient instruction set synthesis for reconfigurable system-on-chip designs
Silicon compilers are often used in conjunction with Field Programmable Gate Arrays (FPGAs) to deliver flexibility, fast prototyping, and accelerated time-to-market. Many of these...
Philip Brisk, Adam Kaplan, Majid Sarrafzadeh
AIRS
2004
Springer
14 years 23 days ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
DMIN
2006
122views Data Mining» more  DMIN 2006»
13 years 8 months ago
Clustering of Bi-Dimensional and Heterogeneous Time Series: Application to Social Sciences Data
We present an application of bi-dimensional and heterogeneous time series clustering in order to resolve a Social Sciences issue. The dataset is the result of a survey involving mo...
Rémi Gaudin, Sylvaine Barbier, Nicolas Nico...
CLIN
2003
13 years 8 months ago
On the Statistical Consistency of DOP Estimators
A statistical estimator attempts to guess an unknown probability distribution by analyzing a sample from this distribution. One desirable property of an estimator is that its gues...
Detlef Prescher, Remko Scha, Khalil Sima'an, Andre...
STRINGOLOGY
2004
13 years 8 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö