نتایج جستجو برای: up method

تعداد نتایج: 2430536  

Journal: :IJCINI 2012
Douglas Walton

This paper surveys the state-of-the-art of argumentation schemes used as argument extraction techniques in cognitive informatics and uses examples to show how a series of connected problems needs to be solved to move these techniques forward to computational implementation. Some of the schemes considered are argument from expert opinion, practical reasoning, argument from negative consequences,...

2015
Zheng Qu Anuradha M. Annaswamy Eugene Lavretsky

Non-square multi-input-multi-output (MIMO) plants are becoming increasingly common, as the addition of multiple sensors is becoming prevalent. However, square systems are needed sometimes as an leverage when it comes to design and analysis, as they possess desirable properties such as strict positive realness. This paper presents a squaring up method that adds artificial inputs to a class of MI...

2000
Judith M. Kessens Helmer Strik Catia Cucchiarini

In this paper a Bottom-Up (BU) method of obtaining information about pronunciation variation is proposed. BU transcriptions (Tbu) were obtained by letting a CSR decide for each phone whether it was deleted or not. The Tbu were compared to transcriptions obtained automatically with a TopDown method, and the agreement appeared to be very high. Subsequently, the Tbu were aligned with canonical ref...

2000
Judith M. Kessens Helmer Strik Catia Cucchiarini

In this paper a Bottom-Up (BU) method of obtaining information about pronunciation variation is proposed. BU transcriptions (Tbu) were obtained by letting a CSR decide for each phone whether it was deleted or not. The Tbu were compared to transcriptions obtained automatically with a TopDown method, and the agreement appeared to be very high. Subsequently, the Tbu were aligned with canonical ref...

2016
Lorenzo Candeago Daniel Larraz Albert Oliveras Enric Rodríguez-Carbonell Albert Rubio

Over the years the constraint-based method has been successfully applied to a wide range of problems in program analysis, from invariant generation to termination and non-termination proving. Quite often the semantics of the program under study as well as the properties to be generated belong to difference logic, i.e., the fragment of linear arithmetic where atoms are inequalities of the form u...

2014
Dominique Fortuné Daniela Istrate

Wideband current transducers with a voltage output are often used to measure AC currents at frequencies up to 1 MHz. The ratio of output voltage to primary current as a function of frequency is the calibration result of these transducers. A traceable method to measure 1 A alternating current at frequencies of 100 kHz and 1 MHz is reported in this paper. The ratio of the wideband current transdu...

2017
Guillaume Noyel

Köhler’s method is a useful multi-thresholding technique based on boundary contrast. However, the direct algorithm has a too high complexity O(N) i.e. quadratic with the pixel numbers N to process images at a sufficient speed for practical applications. In this paper, a new algorithm to speed up Köhler’s method is introduced with a complexity in O(NM), M is the number of grey levels. The propos...

2001
Olli Virmajoki Pasi Fränti Timo Kaukoranta

Timo Kaukoranta University of Turku Turku Center for Computer Science Department of Computer Science Lemminkäisenkatu 14A FIN-20520 Turku, Finland Abstract. The pairwise nearest neighbor (PNN) method is a simple and well-known method for codebook generation in vector quantization. In its exact form, it provides a good-quality codebook but at the cost of high run time. A fast exact algorithm was...

Journal: :Inf. Process. Lett. 2000
Rolf Niedermeier Peter Rossmanith

A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I, k) as its input and has to decide whether (I, k) ∈ L for some parameterized problem L. Many parameterized algorithms work in two stages: reduction to a problem kernel and bounded search tree. Their time complexity is then of the form O(p(|I|) + q(k)ξ), where q(k) is the size of the problem kernel. We show ho...

Journal: :Neurocomputing 2007
Yong Xu David Zhang Fengxi Song Jing-Yu Yang Zhong Jing Miao Li

Kernel principal component analysis (KPCA) extracts features of samples with an efficiency in inverse proportion to the size of the training sample set. In this paper, we develop a novel method to improve KPCA-based feature extraction. The developed method is the first one that is methodologically consistent with KPCA. Experiments on several benchmark datasets illustrate that the feature extrac...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید