نتایج جستجو برای: pascal matrix

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

Journal: :Journal of Machine Learning Research 2009
Kristian Woodsend Jacek Gondzio

Support vector machines are a powerful machine learning technology, but the training process involves a dense quadratic optimization problem and is computationally challenging. A parallel implementation of linear Support Vector Machine training has been developed, using a combination of MPI and OpenMP. Using an interior point method for the optimization and a reformulation that avoids the dense...

2017
Karl Ljungkvist Martin Kronbichler

In this paper, we consider matrix-free finite-element techniques for efficient numerical solution of partial differential equations on modern manycore processors such as graphics cards. We present a GPU parallelization of a completely matrix-free geometric multigrid iterative solver, with support for general curved and adaptively refined meshes with hanging nodes. Comparing our implementation r...

Journal: :Archivos de la Sociedad Espanola de Oftalmologia 2007
H Heras-Mulero J Moreno-Montañés L M Sádaba Echarri L Mendiluce Martín

PURPOSE To compare the intraocular pressure measurements as defined by the Pascal tonometer, the Goldmann tonometer and the pneumotonometer. METHODS This was an observational clinical study, which included two hundred and five randomly selected subjects recruited from the Ophthalmology Department. The intraocular pressure measurements were performed with each tonometry technique in a randomiz...

2016
Anna Khmelnitskaya Gerard van der Laan Dolf Talman

The triangular array of binomial coefficients, or Pascal’s triangle, is formed by starting with an apex of 1. Every row of Pascal’s triangle can be seen as a line-graph, to each node of which the corresponding binomial coefficient is assigned. We show that the binomial coefficient of a node is equal to the number of ways the line-graph can be constructed when starting with this node and adding ...

1995
Thomas Jakobsen

It is possible to cryptanalyze simple substitution ciphers (both mono-and polyalphabetic) by using a fast algorithm based on a process where an initial key guess is reened through a number of iterations. In each step the plaintext corresponding to the current key is evaluated and the result used as a measure of how close we are in having discovered the correct key. It turns out that only knowle...

2017
Ahmad Abdelfattah Azzam Haidar Stanimire Tomov Jack J. Dongarra

This paper presents new algorithmic approaches and optimization techniques for LU factorization and matrix inversion of millions of very small matrices using GPUs. These problems appear in many scientific applications including astrophysics and generation of block-Jacobi preconditioners. We show that, for very small problem sizes, design and optimization of GPU kernels require a mindset differe...

Journal: :International Journal of Advanced Technology in Mechanical, Mechatronics and Material 2022

Pico hydro is a power plant that uses water as turbine propulsion can generate electricity by generator. This research will discuss the numerical analysis of effect number threads on blades. The process Computational Fluid Dynamic method and software used in ANSYS FLUENT. In variation 1 9 threaded blades, 2 6 threads, 3 4 threads. Based simulation results with blades highest torque at TSR 12 0....

2008
Derek Hoiem Santosh K. Divvala James H. Hays

To tackle the challenging dataset presented in this challenge, we use the highly successful appearance-based detector of Felzenszwalb et al. [1] and augment it with rich contextual cues extracted from the image to further improve its performance. Specifically, we train detectors to obtain the confidence that a window contains an object based solely on global scene statistics [2, 3], nearby regi...

Journal: :J. Comb. Theory, Ser. A 2009
Saibal Mitra

We have obtained the exact asymptotics of the determinant det1≤r,s≤L h ` r+s−2 r−1 ́

2009
Kristian Woodsend Jacek Gondzio

Support Vector Machines are a powerful machine learning technology, but the training process involves a dense quadratic optimization problem and is computationally challenging. A parallel implementation of Support Vector Machine training has been developed, using a combination of MPI and OpenMP. Using an interior point method for the optimization and a reformulation that avoids the dense Hessia...

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

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