γλώσσες
Σελίδες
Νομικός
Explore all categories to find your favorite topic
Explicit Non-linear Optimal Control Law for Continuous Time Systems via Parametric Programming Vassilis Sakizlis, Vivek Dua, Stratos Pistikopoulos Centre for Process Systems…
International Mathematical Forum, 2, 2007, no. 2, 45 - 68 Evaluation of the convolution sums∑ l+18m=n σlσm and ∑ 2l+9m=n σlσm Ayşe Alaca, Şaban Alaca and Kenneth…
Lower bounds for Gromov width of coadjoint orbits in SO(n). Milena Pabiniak UIUC December 6, 2011 Problem suggested by prof Yael Karshon, extension of PhD work of her student…
Design Strategies for ARX with Provable Bounds: SPARX and LAX Daniel Dinu1, Léo Perrin1, Aleksei Udovenko1, Vesselin Velichkov1, Johann Großschädl1, Alex Biryukov1 1SnT,…
Mathematica Aeterna Vol 8 2018 no 3 165 - 185 The evaluation of infinite sums of products of two Bessel functions R B Paris Division of Computing and Mathematics Abertay…
Slide 1Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes Kenji Obata Slide 2 Codes Error correcting code C : {0,1} n {0,1} m with decoding procedure A s.t.…
Experimental bounds on Lorentz violation in the neutrino sector and baryonic asymmetry E. Di Grezia (Dipartimento di Scienze Fisiche, Universit`a di Napoli “Federico II”)…
ABSTRACT Title of dissertation: A THEORY OF CRAMÉR-RAO BOUNDS FOR CONSTRAINED PARAMETRIC MODELS Terrence Joseph Moore Jr Doctor of Philosophy 2010 Dissertation directed…
Slide 1How to Grow Your Lower Bounds Mihai P ă trașcu Tutorial, FOCS’10 Slide 2 A Personal Story MIT freshman, 2002 … half year and no solution later What problem could…
Lower bounds for Gromov width of coadjoint orbits of U(n) and SO(n). Milena Pabiniak ETH, January 11th 2012 Problem suggested by prof Yael Karshon, extension of PhD work…
Slide 1New degree bounds for polynomials with prescribed signs Ryan ODonnell (MIT) Rocco Servedio (Harvard/Columbia) Slide 2 Polynomials with prescribed signs Suppose m disjoint…
Supplementary Material: The Edge of Depth: Explicit Constraints between Segmentation and Depth Shengjie Zhu Garrick Brazil Xiaoming Liu Michigan State University East Lansing…
Slide 1Lower bounds for epsilon-nets Gabriel Nivasch Presenting work by: Noga Alon, János Pach, Gábor Tardos Slide 2 Epsilon-nets Let R be a family of ranges. Say, R =…
Ordinary Differential Equations László Losonczi University of Debrecen Faculty of Economics and Business Administration László Losonczi DE Ordinary Differential Equations…
Impredicative Overloading in Explicit Mathematics Thomas Studer ∗ May 10 2001 Abstract We introduce the system OTN of explicit mathematics based on elementary separation…
Atmos Chem Phys 11 6895–6910 2011 wwwatmos-chem-physnet1168952011 doi:105194acp-11-6895-2011 © Authors 2011 CC Attribution 30 License Atmospheric Chemistry and Physics…
Slide 1 Explicit Non-linear Optimal Control Law for Continuous Time Systems via Parametric Programming Vassilis Sakizlis, Vivek Dua, Stratos Pistikopoulos Centre for Process…
H:\eggrafa\personal\CV_tsili\CVtheo_en_03_web\compnets_public\serica_w_web.doc 1 SERICA_ω. An extension of the SERICA algorithm G. I. Mousadis1, T. A. Tsiligirides1 and…
Tight Bounds for Online Vector Bin Packing Ilan Cohen Joint work with : Yossi Azar,Bruce Shepherd, Seny Kamara Jobs Scheduling Scheduler Server 1 Server N Jobs Scheduling…
Πολυμάθεια Studi Classici offerti a Mario Capasso a cura di PAOLA DAVOLI NATASCIA PELLÉ ISBN volume 978-88-6760-379-4 2018 © Pensa MultiMedia Editore s.r.l. 73100…