نتایج جستجو برای: iul factorization

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

2016
Juan José Burred

Factorsynth is a new software tool, developed in the Max environment, that implements sound processing based on matrix factorization techniques. In particular, Nonnegative Matrix Factorization is applied to the input sounds, which produces a set of temporal and spectral components that can be then freely manipulated and combined to produce new sounds. Based on a simple graphical interface that ...

2000
Sabine Jeschonnek

In the literature, one often finds calculations of (e, ep) reactions at GeV energies using the factorization approach. Factorization implies that the differential cross section can be written as the product of an off-shell electron-proton cross section and a distorted missing momentum distribution. While this factorization appears in the non-relativistic plane wave impulse approximation, it is ...

2006
J. P. Ma Q. Wang

Transverse-momentum dependent (TMD) light-cone wave functions of a light meson are important ingredients in the TMD QCD factorization of exclusive processes. This factorization allows one conveniently resum Sudakov logarithms appearing in collinear factorization. The TMD light-cone wave functions are not simply related to the standard light-cone wave functions in collinear factorization by inte...

2000
Sabine Jeschonnek

In the literature, one often finds calculations of (e, ep) reactions at GeV energies using the factorization approach. Factorization implies that the differential cross section can be written as the product of an off-shell electron-proton cross section and a distorted missing momentum distribution. While this factorization appears in the non-relativistic plane wave impulse approximation, it is ...

2012
Modou Gueye Talel Abdessalem Hubert Naacke

It is today accepted that matrix factorization models allow a high quality of rating prediction in recommender systems. However, a major drawback of matrix factorization is its static nature that results in a progressive declining of the accuracy of the predictions after each factorization. This is due to the fact that the new obtained ratings are not taken into account until a new factorizatio...

2006
Thomas Neumann Sven Helmer Guido Moerkotte

We examine the problem of producing the optimal evaluation order for queries containing joins, selections, and maps. Specifically, we look at the case where common subexpressions involving expensive UDF calls can be factored out. First, we show that ignoring factorization during optimization can lead to plans that are far off the best possible plan: the difference in cost between the best plan ...

2015
Takatoshi Nakamura Takashi Nodera Takatoshi NAKAMURA Takashi NODERA

The ILU factorization is one of the most popular preconditioners for the Krylov subspace method, alongside the GMRES. Properties of the preconditioner derived from the ILU factorization are relayed onto the dropping rules. Recently, Zhang et al. [Numer. Linear. Algebra. Appl., Vol. 19, pp. 555–569, 2011] proposed a Flexible incomplete Cholesky (IC) factorization for symmetric linear systems. Th...

Journal: :CoRR 2012
Modou Gueye Talel Abdessalem Hubert Naacke

It is today accepted that matrix factorization models allow a high quality of rating prediction in recommender systems. However, a major drawback of matrix factorization is its static nature that results in a progressive declining of the accuracy of the predictions after each factorization. This is due to the fact that the new obtained ratings are not taken into account until a new factorizatio...

Journal: :CoRR 2012
Satoshi Tazawa

Though integer factorization and discrete logarithm problem are both practically and theoretically important, the computational complexity of these problems remained unknown. By comparing integer factorization problem with a problem in P and NP-complete problems, I show that the decision problem version of integer factorization problem is neither in P nor NP-complete. In addition, integer facto...

Journal: :Theoretical Computer Science 2021

V -order is a total order on strings that determines an instance of Unique Maximal Factorization Families (UMFFs), generalization Lyndon words. The fundamental -comparison can be done in linear time and constant space. has been proposed as alternative to lexicographic (lexorder) the computation suffix arrays suffix-sorting induced by Burrows-Wheeler transform (BWT). In line with recent interest...

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

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