Sciweavers

4099 search results - page 263 / 820
» First Class Patterns
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 8 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
VIP
2003
15 years 7 months ago
Using Dual Cascading Learning Frameworks for Image Indexing
To bridge the semantic gap in content-based image retrieval, detecting meaningful visual entities (e.g. faces, sky, foliage, buildings etc) in image content and classifying images...
Joo-Hwee Lim, Jesse S. Jin
SOFTWARE
2002
15 years 6 months ago
Temporal Probabilistic Concepts from Heterogeneous Data Sequences
We consider the problem of characterisation of sequences of heterogeneous symbolic data that arise from a common underlying temporal pattern. The data, which are subject to impreci...
Sally I. McClean, Bryan W. Scotney, Fiona Palmer
DATAMINE
2006
157views more  DATAMINE 2006»
15 years 6 months ago
Data Clustering with Partial Supervision
Clustering with partial supervision finds its application in situations where data is neither entirely nor accurately labeled. This paper discusses a semisupervised clustering algo...
Abdelhamid Bouchachia, Witold Pedrycz
IPL
2000
111views more  IPL 2000»
15 years 6 months ago
On the performance of the first-fit coloring algorithm on permutation graphs
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
Stavros D. Nikolopoulos, Charis Papadopoulos