3096 search results - page 55 / 620 » The Generalized FITC Approximation |
MSS
2008
IEEE
13 years 8 months ago
2008
IEEE
The problem of deriving weights from pairwise comparison matrices has been treated extensively in the literature. Most of the results are devoted to the case when the matrix under...
TALG
2008
13 years 8 months ago
2008
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
WDAG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
COCOON
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...