Sciweavers

30 search results - page 5 / 6
» Finding approximate palindromes in strings
Sort
View
JDA
2008
87views more  JDA 2008»
13 years 5 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
ACL
2009
13 years 3 months ago
Variational Decoding for Statistical Machine Translation
Statistical models in machine translation exhibit spurious ambiguity. That is, the probability of an output string is split among many distinct derivations (e.g., trees or segment...
Zhifei Li, Jason Eisner, Sanjeev Khudanpur
FINTAL
2006
13 years 9 months ago
Regular Approximation of Link Grammar
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
Filip Ginter, Sampo Pyysalo, Jorma Boberg, Tapio S...
ICMCS
2006
IEEE
103views Multimedia» more  ICMCS 2006»
13 years 11 months ago
Multiplierless Approximation of Fast DCT Algorithms
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
Raymond Chan, Moon-chuen Lee
BMCBI
2011
12 years 9 months ago
Extracting scientific articles from a large digital archive: BioStor and the Biodiversity Heritage Library
Background: The Biodiversity Heritage Library (BHL) is a large digital archive of legacy biological literature, comprising over 31 million pages scanned from books, monographs, an...
Roderic D. M. Page