γλώσσες
Σελίδες
Νομικός
Explore all categories to find your favorite topic
The Linguistic Review 33 (Special Issue on Labeling), 129-175, 2016. (A) Case for Labeling: Labeling in Languages without φ-feature Agreement* Mamoru Saito 1. Introduction…
Tight Bounds for Dynamic Convex Hull Queries (Again) Lower Bounds for 2-Dimensional Range Counting Mihai Pătraşcu summer @ Range Counting SELECT count(*) FROM employees…
mmsBfinal_revision1.dviA.J.E.M. Janssen 1 Abstract This paper presents new Gaussian approximations for the cumulative distri- bution function P(Aλ ≤ s) of a Poisson
matching.dviMatching Principles Institute for Advanced Study, Princeton, US and Steklov Mathematical Institute, Moscow, Russia Abstract For an arbitrary hypergraph H, let
Ilan Komargodski∗ Ran Raz∗ Abstract We give an explicit function h : {0, 1}n → {0, 1} such that any deMorgan formula of size O(n2.499) agrees with h on
Sanjeev Arora∗ Aditya Bhaskara † Rong Ge‡ Tengyu Ma§ October 24, 2013 Abstract We give algorithms with provable guarantees that learn a class of
Yair Carmon John C. Duchi Oliver Hinder Aaron Sidford {yairc,jduchi,ohinder,sidford}@stanford.edu Abstract We prove lower bounds on the complexity of finding ε-stationary
Capacity Bounds on Polynomial Coefficients Polynomial Capacity: Theory Applications Generalizations Jonathan Leake Technische Universität Berlin December 17th 2020 Jonathan…
Doctor of Philosophy C0-Semigroups Doctor of Philosophy Hilary 2002 In this thesis, we study a non-analytic growth bound ζ(f) associated with an exponen- tially bounded
Communications in Commun Math Phys 87 429-447 1982 Mathematical Physics © Springer-Verlag 1982 Exponential Bounds and Absence of Positive Eigenvalues for JV-Body Schrδdinger…
TOPOLOGICAL LOWER BOUNDS FOR ARITHMETIC NETWORKS ANDREI GABRIELOV AND NICOLAI VOROBJOV Abstract. We prove that the depth of any arithmetic network for deciding membership…
ar X iv :0 90 2. 43 66 v1 m at h. N T 2 5 Fe b 20 09 ON THE MULTIPLICATIVE ORDER OF an MODULO n Jonathan Chappelon February 25, 2009 Abstract Let n be a positive integer…
EXPLICIT BOUNDS FOR THE PSEUDOSPECTRA OF VARIOUS CLASSES OF MATRICES AND OPERATORS FEIXUE GONG1, OLIVIA MEYERSON2, JEREMY MEZA3, ABIGAIL WARD4 MIHAI STOICIU5 (ADVISOR) SMALL…
SUBCONVEXITY BOUNDS FOR AUTOMORPHIC L–FUNCTIONS A Diaconu and P Garrett Abstract We break the convexity bound in the t–aspect for L–functions attached to cuspforms…
Dirac gaugino as leptophilic dark matter Jong-Chul Park May 14, 2014 Mitchell Workshop on Collider & Dark Matter Physics Bounds on DM interpretation of Fermi-LAT GeV…
Lower Bounds for Data Structures Mihai Pătrașcu 2nd Barriers Workshop Aug 29 ’10 Model of Computation Word = w-bit integer Memory = array of S words Unit-time operations…
Improved Average-Case Lower Bounds for DeMorgan Formula Size Matching Worst-Case Lower Bound Ilan Komargodski∗ Ran Raz∗ Avishay Tal∗ Abstract We give a function h :…
Improved Risk Bounds in Isotonic Regression Sabyasachi Chatterjee, Adityanand Guntuboyina∗ and Bodhisattva Sen† Yale University, University of California at Berkeley…
1 Ετικετέζες HERMA HERMA H400 Labeling Machines Presentation ΘΕΟ∆ΩΡΟΥ ΑΥΤΟΜΑΤΙΣΜΟΙ ΑΒΕΤΕ Ηλεκτρονική ετικετέζα Herma…
Introduction The Extended Lee Weight and Its Gray Map Singleton Bounds For Codes Over Zps Kernel and Independence of φL(C) Linearity and Duality of φL(C) References