Lemmas

Results: 207



#Item
61Math. Appl), 57–78 DOI: maON A TWO-POINT BOUNDARY VALUE PROBLEM FOR THIRD-ORDER LINEAR FUNCTIONAL DIFFERENTIAL EQUATIONS. PART I.

Math. Appl), 57–78 DOI: maON A TWO-POINT BOUNDARY VALUE PROBLEM FOR THIRD-ORDER LINEAR FUNCTIONAL DIFFERENTIAL EQUATIONS. PART I.

Add to Reading List

Source URL: ma.fme.vutbr.cz

Language: English - Date: 2014-02-11 10:41:46
62Romero-Isart  Problem’s set #3 2014S PS

Romero-Isart Problem’s set #3 2014S PS

Add to Reading List

Source URL: iqoqi.at

Language: English - Date: 2014-10-09 06:17:45
63Seminar on Algorithms and Geometry – Handout 6 Robert Krauthgamer May 21, 2009 Today’s topics We describe an alternative proof of the Johnson-Lindenstrauss lemma, this time from the perspective of measure concentrati

Seminar on Algorithms and Geometry – Handout 6 Robert Krauthgamer May 21, 2009 Today’s topics We describe an alternative proof of the Johnson-Lindenstrauss lemma, this time from the perspective of measure concentrati

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2009-05-21 16:13:11
64CPS296.2 Geometric Optimization  April 12, 2007 Lecture 25: Johnson Lindenstrauss Lemma Lecturer: Pankaj K. Agarwal

CPS296.2 Geometric Optimization April 12, 2007 Lecture 25: Johnson Lindenstrauss Lemma Lecturer: Pankaj K. Agarwal

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2007-05-07 15:21:34
65Area Attack! I. Calculate 1. The figure below shows two squares. The sides of the smaller square are 3'', those of the larger square, 4''. Point D is the corner of the large square and the center of the small square. The

Area Attack! I. Calculate 1. The figure below shows two squares. The sides of the smaller square are 3'', those of the larger square, 4''. Point D is the corner of the large square and the center of the small square. The

Add to Reading List

Source URL: jrmf.org

Language: English - Date: 2015-04-16 23:16:20
66Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability Konstantin Makarychev IBM T.J. Watson Research Center  Yury Makarychev

Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability Konstantin Makarychev IBM T.J. Watson Research Center Yury Makarychev

Add to Reading List

Source URL: konstantin.makarychev.net

Language: English - Date: 2014-06-08 22:16:20
67Programming Language Techniques for Cryptographic Proofs⋆ Gilles Barthe1 , Benjamin Gr´egoire2, and Santiago Zanella B´eguelin1 1  IMDEA Software, Madrid, Spain, {Gilles.Barthe,Santiago.Zanella}@imdea.org

Programming Language Techniques for Cryptographic Proofs⋆ Gilles Barthe1 , Benjamin Gr´egoire2, and Santiago Zanella B´eguelin1 1 IMDEA Software, Madrid, Spain, {Gilles.Barthe,Santiago.Zanella}@imdea.org

Add to Reading List

Source URL: certicrypt.gforge.inria.fr

Language: English - Date: 2013-06-17 13:32:36
68Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs W. T. Gowers Abstract. The main results of this paper are regularity and counting lemmas for 3uniform hypergraphs. A combination of these two results giv

Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs W. T. Gowers Abstract. The main results of this paper are regularity and counting lemmas for 3uniform hypergraphs. A combination of these two results giv

Add to Reading List

Source URL: www.dpmms.cam.ac.uk

Language: English - Date: 2005-03-14 06:41:35
69DROPLET MINIMIZERS OF AN ISOPERIMETRIC PROBLEM WITH LONG-RANGE INTERACTIONS MARCO CICALESE AND EMANUELE SPADARO A BSTRACT. We give a detailed description of the geometry of single droplet patterns in a nonlocal isoperime

DROPLET MINIMIZERS OF AN ISOPERIMETRIC PROBLEM WITH LONG-RANGE INTERACTIONS MARCO CICALESE AND EMANUELE SPADARO A BSTRACT. We give a detailed description of the geometry of single droplet patterns in a nonlocal isoperime

Add to Reading List

Source URL: cvgmt.sns.it

Language: English - Date: 2012-11-30 08:21:58
70Bipartite graphs of approximate rank 1. W. T. Gowers §1. Introduction. Quasirandomness is a central concept in graph theory, and has played an important part in arithmetic combinatorics as well. Roughly speaking, a noti

Bipartite graphs of approximate rank 1. W. T. Gowers §1. Introduction. Quasirandomness is a central concept in graph theory, and has played an important part in arithmetic combinatorics as well. Roughly speaking, a noti

Add to Reading List

Source URL: www.dpmms.cam.ac.uk

Language: English - Date: 2007-05-19 10:57:27