Sciweavers

247 search results - page 5 / 50
» Incremental String Comparison
Sort
View
77
Voted
IJCNN
2008
IEEE
15 years 3 months ago
A comparison of fuzzy ARTMAP and Gaussian ARTMAP neural networks for incremental learning
Abstract— Automatic pattern classifiers that allow for incremental learning can adapt internal class models efficiently in response to new information, without having to retrai...
Eric Granger, Jean-François Connolly, Rober...
ICDCS
2006
IEEE
15 years 3 months ago
PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network
In this work we propose and develop a comprehensive infrastructure, coined PastryStrings, for supporting rich queries on both numerical (with range, and comparison predicates) and...
Ioannis Aekaterinidis, Peter Triantafillou
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
14 years 9 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
14 years 10 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson