Sciweavers

1529 search results - page 80 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
RECOMB
2004
Springer
16 years 4 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
ICANN
2007
Springer
15 years 7 months ago
Fuzzy Classifiers Based on Kernel Discriminant Analysis
In this paper, we discuss fuzzy classifiers based on Kernel Discriminant Analysis (KDA) for two-class problems. In our method, first we employ KDA to the given training data and ca...
Ryota Hosokawa, Shigeo Abe
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
15 years 10 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
ICDAR
2011
IEEE
14 years 3 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
IJIT
2004
15 years 5 months ago
Restartings: A Technique to Improve Classic Genetic Algorithms' Performance
In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed. The idea of restarting a Genetic Algorithm is applied in order to obtain better...
Grigorios N. Beligiannis, Georgios A. Tsirogiannis...