نتایج جستجو برای: algo

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

2004
Ivan Goethals Bart Vanluyten Bart De Moor

In this paper, we introduce a new technique for the separation of physical and spurious modes based on an initial clustering in frequency-damping space, followed by a self-learning classification algorithm. For the classification, Least Squares Support Vector Machines are used, a Least Squares version of the theory of Support Vector Machines which maps the classification problem to a high-dimen...

2005
Nikos Vlassis

We present a novel EM algorithm for model-based image segmentation which incorporates efficient and economical spatial constrains among pixels via a Markov random field model. We adopt a generative model in which the unobserved class labels of neighboring pixels in the image are assumed to be generated by prior distributions with similar parameters. We derive a penalized log-likelihood optimiza...

Journal: :Canadian Journal of Science, Mathematics and Technology Education 2022

2010
H. Zheng M. Z. Wang Z. Q. Zhao L. L. Li

This paper presents a fast and effective electromagnetic reconstruction algorithm with phaseless data under weak scattering conditions. The proposed algorithm is based on the phaseless data multiplicative regularized contrast sources inversion method (PDMRCSI). We recast the weak scattering problem as an optimization problem in terms of the undetermined contrast and contrast sources. Using the ...

1994
Rumen Andonov Sanjay V. Rajopadhye

Architectures parallèles, bases de données, réseaux et systèmes distribués Abstract: We systematically derive an improved algorithm (called the sparse algorithm) for the general knapsack problem which has better average case performance than the standard (dense) dynamic programming algorithm. The derivation is based on transformation of the standard recurrences into a stream functional programs...

1994
Rumen Andonov Sanjay Rajopadhye

We present a formal derivation and proof of correctness of a systolic array for the knapsack problem, a well known, NP-complete problem. The dependency graph of the algorithm is not completely known statically, so the derivation also serves as a case study for systolic synthesis for this class of programs. The array is itself important since it achieves optimal performance on a model much weake...

2002
Lucio C. Rovati

Methods: Two hundred two patients with knee osteoarthritis (using American College of Rheumatology criteria) were randomized to receive oral glucosamine sulfate, 1500 mg once a day, or placebo. Changes in radiographic minimum joint space width were measured in the medial compartment of the tibiofemoral joint, and symptoms were assessed using the algo-functional indexes of Lequesne and WOMAC (We...

2007
Jihuan Ding Tomás Ebenlendr Jirí Sgall Guochuan Zhang

We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to e/(e − 1) ≈ 1.58 as the number of machine increases. For m ≥ 3, this is the first algorithm better than 2-competitive greedy algo-

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

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