Par4All: From Convex Array Regions to Heterogeneous Computing Mehdi Amini1,2 Béatrice Creusillet2 Stéphanie Even2 Ronan Keryell2

Source URL: impact.gforge.inria.fr

Réflexions pour la mise en œuvre d’un dispositif de formation multimodal Mehdi BEAUXIS-AUSSALET Psychologue – ingénieur pédagogique Pôle de production pédagogique

Source URL: www.acteursfpc.paysdelaloire.fr

LOWER BOUNDS FOR POLYNOMIALS USING GEOMETRIC PROGRAMMING MEHDI GHASEMI AND MURRAY MARSHALL Abstract. We make use of a result of Hurwitz and Reznick], and a consequence of this result due to Fidalgo and Kovacec [6

Source URL: math.usask.ca

Forum for Electromagnetic Research Methods and Application Technologies (FERMAT) High-Performance Multi-Coil Inductive Power Transmission Links Mehdi Kiani(1) and Maysam Ghovanloo(2) (1)

Source URL: www.e-fermat.org

CLOSURE OF THE CONE OF SUMS OF 2d-POWERS IN CERTAIN WEIGHTED `1 -SEMINORM TOPOLOGIES MEHDI GHASEMI, MURRAY MARSHALL, SVEN WAGNER Abstract. In [3] Berg, Christensen and Ressel prove that the closure of the P cone of sums

Source URL: math.usask.ca

Lower bounds for a polynomial in terms of its coefficients Mehdi Ghasemi and Murray Marshall Abstract. We determine new sufficient conditions in terms of the coefficients for a polynomial f ∈ R[X] of degree 2d (d ≥ 1

Source URL: math.usask.ca

INTERSPEECHRegularized Subspace n-Gram Model for Phonotactic iVector Extraction ˇ Mehdi Soufifar 1,2 , Luk´asˇ Burget1 , Oldˇrich Plchot1, Sandro Cumani1,3 , Jan “Honza” Cernock´ y1

Source URL: www.fit.vutbr.cz

• Statistics
• Estimation theory
• Probability
• Regression analysis
• Probability distributions
• N-gram
• Expectationmaximization algorithm
• Multinomial distribution
• Maximum likelihood estimation
• Parameter
• Logistic regression

LOWER BOUNDS FOR POLYNOMIALS USING GEOMETRIC PROGRAMMING MEHDI GHASEMI AND MURRAY MARSHALL Abstract. We make use of a result of Hurwitz and Reznick], and a consequence of this result due to Fidalgo and Kovacec [5

Source URL: math.usask.ca

Tightly-Secure Signatures From Lossy Identification Schemes Michel Abdalla1 , Pierre-Alain Fouque1 , Vadim Lyubashevsky1 , and Mehdi Tibouchi2 ´ Ecole

Source URL: www.di.ens.fr

LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS MEHDI GHASEMI AND MURRAY MARSHALL Abstract. Recently Lasserre [6] gave a sufficient condition in terms of the coefficients for a polynomial f ∈ R[X] of degree

Source URL: math.usask.ca