Performance Characterization of a Commercial Video Streaming Service Mojgan Ghasemi Partha Kanuparthy

Source URL: cs.brown.edu

• Computing
• Multimedia
• Information and communications technology
• Concurrent computing
• Internet broadcasting
• Network protocols
• Internet protocols
• Telecommunications engineering
• Latency
• Cache
• Network performance
• Lag

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

International Journal of Social Science and Humanity, Vol. 2, No. 6, NovemberDemystifying the Myth of Motherhood: Toni Morrison’s Revision of African-American Mother Stereotypes Parvin Ghasemi and Rasool Hajizad

Source URL: www.ijssh.org

Murray Marshall’s publications on Positive Polynomials and Moment Problems 1. M. Ghasemi, M. Infusino, S. Kuhlmann, M. Marshall, A continuous moment problem for locally convex spaces, in preparation. 2. M. Ghasemi, S.

Source URL: www.gmu.ge

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 ON THE GLOBAL MINIMUM OF A POLYNOMIAL M. GHASEMI, J.B. LASSERRE, M. MARSHALL Abstract. We extend the method of Ghasemi and Marshall [SIAM. J. Opt), pp], to obtain a lower bound fgp,M for

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

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

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

LOWER BOUNDS ON THE GLOBAL MINIMUM OF A POLYNOMIAL M. GHASEMI, J.B. LASSERRE, M. MARSHALL Abstract. We extend the method of Ghasemi and Marshall [SIAM. J. Opt), pp], to obtain a lower bound fgp,M for

Source URL: math.usask.ca