3946 search results - page 130 / 790 » The computational complexity of choice sets |
188
click to vote
ERCIM
2007
15 years 6 months ago
2007
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute s...
193
click to vote
IANDC
2007
15 years 6 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
173
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
167
click to vote
ICANN
2010
Springer
15 years 6 months ago
2010
Springer
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
181
click to vote
PKC
2004
Springer
15 years 12 months ago
2004
Springer
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...