نتایج جستجو برای: extracted k r2078

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

2009
Linlin SHEN

A new fingerprint recognition approach based on features extracted from the wavelet domain is presented. The 64-subband structure proposed by the FBI WSQ standard is used to decompose the frequency of the image. The efficiency of the method is achieved by using the k-nearest neighbor (k-NN) classifier. The result is compared with other image-based methods. For compressed fingerprint images, thi...

2008
Y. Schröder

In this talk, I present the status of attempts to analyze the behavior of the so-called spatial ’t Hooft loop, which can be taken as an order parameter for the deconfinement phase transition in pure SU(N) gauge theory. While lattice data show a strikingly universal scaling of extracted k–string tensions for various values of k and N , the analytic approach to these observables might need some r...

2015
C. H. Patil S. M. Mali L. Bottou Y. Bengio P. Haffner V. N. Vapnik R. O. Duda P. E. Hart D. G. Stork G. G. Rajput Mallikarjun Hangarge Reena Bajaj Lipika Dey P. M. Patil T. R. Sontakke R. J. Ramteke S. C. Mehrotra

In this paper, we present a method for automatic recognition of isolated Marathi handwritten numerals in which Zernike moments and Fourier Descriptors are used as features. After preprocessing the numeral image, Zernike moment and the Fourier Descriptor features of the numeral are extracted. These features are then fed in the k-NN classifier for classification. The proposed method is experiment...

2004
Dipali Pal

We present the preliminary results on φ meson production in the φ → K + K − and φ → e + e − decay channels measured at mid-rapidity in √ s = 200 GeV d + Au collisions at RHIC by the PHENIX experiment. The transverse mass spectra were obtained in both channels. The extracted φ yields are found to be consistent with each other. The results are compared to the measurements in Au + Au collisions at...

2009
Xiulin Ruan Yong P. Chen

We have used classical molecular dynamics based on the Brenner potential describing carbon-carbon covalent bonds to study the melting point and vacancy movement in a rectangular graphene nanoribbon. The melting point of the graphene nanoribbon extracted from the numerical simulation is ~3400 K. We also found that two separated vacancies at high temperature (e.g., ~3000 K, below the melting poin...

2004

Recent measurements in the charm sector at BABAR are reviewed. The scope of the presentation includes the observation of two new narrow mesons in the D + s π 0 and D + s π 0 γ final states as well as the measurement of D 0-D 0 mixing parameters by means of two methods: using the doubly-Cabibbo-suppressed D 0 decay to K + π − and using the ratios of lifetimes extracted from samples of D 0 mesons...

1997
Y. Iwasaki K. Kanaya Y. Kuramashi

A new study is reported of a lattice QCD calculation of the K → ππ decay amplitude with the Wilson quark action in the quenched approximation at β = 6.1. The amplitude is extracted from the K → ππ Green function, and a conversion to the continuum value is made employing a recent one-loop calculation of chiral perturbation theory. The result is consistent with the experimental value if extrapola...

Journal: :Physical review 2021

In this work we study the strong decays of $\phi(2170)$ to final states involving kaonic resonances $K(1460)$, $K_1(1270)$ and $K_1(1400)$, on which experimental data have recently been extracted by BESIII Collaboration. The formalism developed here is based interpreting $K(1460)$ as arising from three-hadron dynamics, inspired our earlier works. For $K_1(1400)$ investigate different descriptio...

2000
E. Ruppert

A concurrent-read exclusive-write PRAM algorithm is developed to find the k shortest paths between pairs of vertices in an edge-weighted directed graph. Repetitions of vertices along the paths are allowed. The algorithm computes an implicit representation of the k shortest paths to a given destination vertex from every vertex of a graph with n vertices and m edges, using O(m+nk log2 k)work and ...

2007
Eric Ruppert

A concurrent-read exclusive-write PRAM algorithm is developed to nd the k shortest paths between pairs of vertices in an edge-weighted directed graph. Repetitions of vertices along the paths are allowed. The algorithm computes an implicit representation of the k shortest paths to a given destination vertex from every vertex of a graph with n vertices and m edges, using O(m + nk log 2 k) work an...

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

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