Sciweavers

6833 search results - page 145 / 1367
» Some two-character sets
Sort
View
ESA
2005
Springer
136views Algorithms» more  ESA 2005»
15 years 10 months ago
Approximating the 2-Interval Pattern Problem
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
Maxime Crochemore, Danny Hermelin, Gad M. Landau, ...
ICAISC
2004
Springer
15 years 9 months ago
Comparison of Instances Seletion Algorithms I. Algorithms Survey
Abstract. Several methods were proposed to reduce the number of instances (vectors) in the learning set. Some of them extract only bad vectors while others try to remove as many in...
Norbert Jankowski, Marek Grochowski
COCOON
2003
Springer
15 years 9 months ago
On Constrained Minimum Pseudotriangulations
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
Günter Rote, Cao An Wang, Lusheng Wang, Yin-F...
SSIAI
2002
IEEE
15 years 9 months ago
Two Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Jason Denton, J. Ross Beveridge
DIS
2000
Springer
15 years 8 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,...