AbstractWe present two new algorithms for the range-efficient F0 estimating problem and improve the previously best known result, proposed by Pavan and Tirthapura in 2005. Furthermore, our algorithms can be applied to improve the previously best known result for the Max-Dominance Norm Problem
The maximum spacing (MSP) method, introduced by Cheng and Amin (1983) and independently by Ranneby (...
C factor Measure of relative dominance of solutions generated Zitzler and Thiele (1999) by one algor...
A fast algorithm for the computation of the optimally frequencydependent scaled H1-norm of a finite ...
AbstractWe present two new algorithms for the range-efficient F0 estimating problem and improve the ...
Consider a set of signals fs: {1,..., N} → [0,...,M] appearing as a stream of tuples (i, fs(i)) in ...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
ℓ⁰ norm based algorithms have numerous potential applications where a sparse signal is recovered fro...
The maximum spacing (MSP) method, introduced by Cheng and Amin (1983) and independently by Ranneby (...
The F-measure, originally introduced in information retrieval, is nowadays routinely used as a perfo...
This paper describes novel and fast, simple and robust algorithm with O(N) expected complexity which...
AbstractGutin et al. [G. Gutin, A. Yeo, Polynomial approximation algorithms for the TSP and the QAP ...
It is often important to check whether the maximum max f of a given function f on a given set B is s...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
In this thesis we analyse the class of maximum coverage problems. For all discussed problems, linear...
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w...
The maximum spacing (MSP) method, introduced by Cheng and Amin (1983) and independently by Ranneby (...
C factor Measure of relative dominance of solutions generated Zitzler and Thiele (1999) by one algor...
A fast algorithm for the computation of the optimally frequencydependent scaled H1-norm of a finite ...
AbstractWe present two new algorithms for the range-efficient F0 estimating problem and improve the ...
Consider a set of signals fs: {1,..., N} → [0,...,M] appearing as a stream of tuples (i, fs(i)) in ...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
ℓ⁰ norm based algorithms have numerous potential applications where a sparse signal is recovered fro...
The maximum spacing (MSP) method, introduced by Cheng and Amin (1983) and independently by Ranneby (...
The F-measure, originally introduced in information retrieval, is nowadays routinely used as a perfo...
This paper describes novel and fast, simple and robust algorithm with O(N) expected complexity which...
AbstractGutin et al. [G. Gutin, A. Yeo, Polynomial approximation algorithms for the TSP and the QAP ...
It is often important to check whether the maximum max f of a given function f on a given set B is s...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
In this thesis we analyse the class of maximum coverage problems. For all discussed problems, linear...
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w...
The maximum spacing (MSP) method, introduced by Cheng and Amin (1983) and independently by Ranneby (...
C factor Measure of relative dominance of solutions generated Zitzler and Thiele (1999) by one algor...
A fast algorithm for the computation of the optimally frequencydependent scaled H1-norm of a finite ...
DOI
Add to ORKG