Sciweavers

5221 search results - page 721 / 1045
» An On-line Problem Database
Sort
View
SPIRE
1999
Springer
15 years 11 months ago
Cross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
Daniel P. Lopresti, Gordon T. Wilfong
KDD
1998
ACM
102views Data Mining» more  KDD 1998»
15 years 11 months ago
Defining the Goals to Optimise Data Mining Performance
In many data mining problems the definition of what structures in the database are to be regarded as interesting or valuable is given only loosely. Typically this is regarded as a...
Mark G. Kelly, David J. Hand, Niall M. Adams
MINAR
1998
Springer
113views Multimedia» more  MINAR 1998»
15 years 11 months ago
Envelope Parameter Calculation of Similarity Indexing Structure
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...
Xuesheng Bai, Guangyou Xu, Yuanchun Shi
PPSN
1998
Springer
15 years 11 months ago
Restart Scheduling for Genetic Algorithms
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
Alex S. Fukunaga
CIKM
1997
Springer
15 years 11 months ago
Applications of Approximate Word Matching in Information Retrieval
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...
James C. French, Allison L. Powell, Eric Schulman