269 search results - page 7 / 54 » Computing the inverse sort transform in linear time |
PRL
2010
13 years 2 months ago
2010
For fast classification under real-time constraints, as required in many imagebased pattern recognition applications, linear discriminant functions are a good choice. Linear discr...
JMLR
2008
13 years 7 months ago
2008
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
CCECE
2009
IEEE
14 years 2 months ago
2009
IEEE
A complex system is expected to show different nominal behaviors under different conditions, and the deviation over time from these nominal behaviors is an indicator of potential ...
CPM
2004
Springer
13 years 11 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...