Sciweavers

1229 search results - page 16 / 246
» On the gaussian distribution of strings
Sort
View
ISPAN
1997
IEEE
14 years 19 days ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
IPL
1998
95views more  IPL 1998»
13 years 8 months ago
A Variation on the Zero-One Law
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L...
CSFW
1996
IEEE
14 years 18 days ago
An Immunological Approach to Change Detection: Theoretical Results
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...
Patrik D'haeseleer
IPPS
2003
IEEE
14 years 1 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
NN
2002
Springer
161views Neural Networks» more  NN 2002»
13 years 8 months ago
AANN: an alternative to GMM for pattern recognition
The objective in any pattern recognition problem is to capture the characteristics common to each class from feature vectors of the training data. While Gaussian mixture models ap...
B. Yegnanarayana, S. P. Kishore