Sciweavers

1229 search results - page 23 / 246
» On the gaussian distribution of strings
Sort
View
TOIS
2002
97views more  TOIS 2002»
13 years 8 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ICPR
2010
IEEE
13 years 6 months ago
Information Theoretic Expectation Maximization Based Gaussian Mixture Modeling for Speaker Verification
The expectation maximization (EM) algorithm is widely used in the Gaussian mixture model (GMM) as the state-of-art statistical modeling technique. Like the classical EM method, th...
Sheeraz Memon, Margaret Lech, Namunu Chinthaka Mad...
GECCO
2004
Springer
107views Optimization» more  GECCO 2004»
14 years 1 months ago
An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
Jonathan E. Rowe, Dzena Hidovic
APPROX
2007
Springer
92views Algorithms» more  APPROX 2007»
14 years 2 months ago
Sublinear Algorithms for Approximating String Compressibility
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
VLDB
2007
ACM
113views Database» more  VLDB 2007»
14 years 8 months ago
Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...
Witold Litwin, Riad Mokadem, Philippe Rigaux, Thom...