Sciweavers

157 search results - page 3 / 32
» A Simple Algorithm for Finding Exact Common Repeats
Sort
View
DIS
2000
Springer
13 years 10 months ago
A Practical Algorithm to Find the Best Subsequence Patterns
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara,...
WCRE
2002
IEEE
13 years 11 months ago
Finding High-Level Structures in Spreadsheet Programs
Spreadsheets are a common tool in end-user programming. But even while important decisions are based on spreadsheet computations, spreadsheets are poorly documented software and t...
Roland Mittermeir, Markus Clermont
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 6 months ago
Longest Common Pattern between two Permutations
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
Dominique Rossin, Mathilde Bouvel
COLING
2010
13 years 1 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
IPM
2008
102views more  IPM 2008»
13 years 6 months ago
Fast exact maximum likelihood estimation for mixture of language model
Language modeling is an effective and theoretically attractive probabilistic framework for text information retrieval. The basic idea of this approach is to estimate a language mo...
Yi Zhang 0001, Wei Xu