905 search results - page 91 / 181 » On the Complexity of uSPR Distance |
LATA
2009
Springer
15 years 2 months ago
2009
Springer
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
106
click to vote
RANDOM
2001
Springer
15 years 2 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
DCC
2000
IEEE
15 years 2 months ago
2000
IEEE
Multiple description lattice vector quantization (MDLVQ) is a technique for two-channel multiple description coding. We observe that MDLVQ, in the form introduced by Servetto, Vai...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
DAGM
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. In this paper we present di erent approaches to structuring covariance matrices within statistical classi ers. This is motivated by the fact that the use of full covarian...