Split (3)

train · 1k rows

text stringlengths 7.27k 650k	label int64 0 10
VARIATIONAL STRUCTURE OF THE OPTIMAL ARTIFICIAL DIFFUSION METHOD FOR THE ADVECTION-DIFFUSION EQUATION K. B. NAKSHATRALA AND A. J. VALOCCHI arXiv:0905.4771v3 [] 15 Dec 2010 Abstract. In this research note, we provide a variational basis for the optimal artificial diffusion method, which has been a cornerstone in devel...	5
arXiv:1706.06638v1 [] 20 Jun 2017 On convergence of the sample correlation matrices in high-dimensional data Sévérien Nkurunziza∗ and Yueleng Wang† Abstract In this paper, we consider an estimation problem concerning the matrix of correlation coefficients in context of high dimensional data settings. In particular,...	10
GENERATING THE IDEALS DEFINING UNIONS OF SCHUBERT VARIETIES arXiv:1405.2945v1 [math.AG] 12 May 2014 ANNA BERTIGER A BSTRACT. This note computes a Gröbner basis for the ideal defining a union of Schubert varieties. More precisely, it computes a Gröbner basis for unions of schemes given by northwest rank conditions ...	0
arXiv:1302.0312v2 [] 20 Sep 2013 ON THE INTERSECTION ALGEBRA OF PRINCIPAL IDEALS SARA MALEC Abstract. We study the finite generation of the intersection algebra of two principal ideals I and J in a unique factorization domain R. We provide an algorithm that produces a list of generators of this algebra over R. In the ...	0
Improved Adaptive Resolution Molecular Dynamics Simulation Iuliana Marin1, Virgil Tudose2, Anton Hadar2, Nicolae Goga1,3, Andrei Doncescu4 Affiliation 1: Faculty of Engineering in Foreign Languages University POLITEHNICA of Bucharest, Bucharest, Romania, n.goga@rug.nl Affiliation 2: Department of Strength of Materials,...	5
arXiv:1611.02660v2 [] 5 Feb 2018 This article has been accepted by IEEE Transactions on Vehicular Technology. Copyright (c) 2015 IEEE. Personal use of this material is permitted. However, permission to use this material for any other purposes must be obtained from the IEEE by sending a request to pubs-permissions@ieee...	7
VIBRATO AND AUTOMATIC DIFFERENTIATION FOR HIGH ORDER DERIVATIVES AND SENSITIVITIES OF FINANCIAL OPTIONS arXiv:1606.06143v1 [q-fin.CP] 20 Jun 2016 GILLES PAGÈS ∗, OLIVIER PIRONNEAU † , AND GUILLAUME SALL ‡ Abstract. This paper deals with the computation of second or higher order greeks of financial securities. ...	5
LATTICE POINTS IN POLYTOPES, BOX SPLINES, AND TODD OPERATORS arXiv:1305.2784v1 [math.CO] 13 May 2013 MATTHIAS LENZ Abstract. Let X be a list of vectors that is totally unimodular. In a previous article the author proved that every real-valued function on the set of interior lattice points of the zonotope defined by ...	0
1 PhaseMax: Convex Phase Retrieval via Basis Pursuit arXiv:1610.07531v3 [] 30 Jan 2018 Tom Goldstein and Christoph Studer Abstract—We consider the recovery of a (real- or complexvalued) signal from magnitude-only measurements, known as phase retrieval. We formulate phase retrieval as a convex optimization problem, ...	7
arXiv:1510.00697v1 [] 2 Oct 2015 Towards a Fully Abstract Compiler Using Micro-Policies — Secure Compilation for Mutually Distrustful Components — Yannis Juglaret1,2 Cătălin Hriţcu1 Benjamin C. Pierce3 1 3 Arthur Azevedo de Amorim3 Antal Spector-Zabusky3 Inria Paris 2 Andrew Tolmach4 Université Paris Diderot (...	6
POD-based reduced-order model of an eddy-current levitation problem arXiv:1710.08180v1 [] 23 Oct 2017 MD Rokibul Hasan, Laurent Montier, Thomas Henneron, and Ruth V. Sabariego Abstract The accurate and efficient treatment of eddy-current problems with movement is still a challenge. Very few works applying reduced-or...	5
Global parameter identification of stochastic reaction networks from single trajectories arXiv:1111.4785v1 [q-bio.MN] 21 Nov 2011 Christian L. Müller† , Rajesh Ramaswamy† , and Ivo F. Sbalzarini Abstract We consider the problem of inferring the unknown parameters of a stochastic biochemical network model from a sin...	5
arXiv:1208.5934v1 [] 29 Aug 2012 ON THE LOCAL COHOMOLOGY MODULES DEFINED BY A PAIR OF IDEALS AND SERRE SUBCATEGORIES KH. AHMADI-AMOLI AND M.Y. SADEGHI Abstract. This paper is concerned about the relation between local cohomology modules defined by a pair of ideals and Serre classes of R-modules, as a generalization o...	0
Using Simulation and Domain Adaptation to Improve Efficiency of Deep Robotic Grasping arXiv:1709.07857v2 [cs.LG] 25 Sep 2017 Konstantinos Bousmalis∗,1 , Alex Irpan∗,1 , Paul Wohlhart∗,2 , Yunfei Bai2 , Matthew Kelcey1 , Mrinal Kalakrishnan2 , Laura Downs1 , Julian Ibarz1 , Peter Pastor2 , Kurt Konolige2 , Sergey Levi...	1
Abstracting an operational semantics to finite automata Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker arXiv:1409.7841v1 [] 27 Sep 2014 IRIT (Institut de Recherche en Informatique de Toulouse) Université de Toulouse, France firstname.lastname @irit.fr ⋆,⋆⋆ Abstract. There is an apparent simi...	6
arXiv:1512.01748v1 [cs.NA] 6 Dec 2015 Restricted Low-Rank Approximation via ADMM Ying Zhang zy013@ie.cuhk.edu.hk December 8, 2015 Abstract The matrix low-rank approximation problem with additional convex constraints can find many applications and has been extensively studied before. However, this problem is shown to ...	8
Limits of CSP Problems and Efficient Parameter Testing arXiv:1406.3514v2 [] 4 Aug 2016 Marek Karpinski∗ Roland Markó† Abstract We present a unified framework on the limits of constraint satisfaction problems (CSPs) and efficient parameter testing which depends only on array exchangeability and the method of cut de...	8
Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Sampling Michael B. Cohen Cameron Musco Christopher Musco∗ arXiv:1511.07263v2 [] 6 Oct 2016 Massachusetts Institute of Technology, EECS Cambridge, MA 02139, USA Email: {micohen,cnmusco,cpmusco}@mit.edu October 10, 2016 Abstract We present a new al...	8
Acylindrical group actions on quasi-trees arXiv:1602.03941v3 [] 26 Mar 2016 S. Balasubramanya Abstract A group G is acylindrically hyperbolic if it admits a non-elementary acylindrical action on a hyperbolic space. We prove that every acylindrically hyperbolic group G has a generating set X such that the correspondin...	4
1 Covert Communication over Classical-Quantum Channels Azadeh Sheikholeslami∗† , Boulat A. Bash† , Don Towsley‡ , Dennis Goeckel∗ , Saikat Guha† and Computer Engineering Department, University of Massachusetts, Amherst, MA † Quantum Information Processing Group, Raytheon BBN Technologies, Cambridge, MA ‡ College of In...	7
A short note about diffuse Bieberbach groups arXiv:1703.04972v3 [] 26 Sep 2017 Rafał Lutowski∗, Andrzej Szczepański∗ and Anna Gąsior† Abstract We consider low dimensional diffuse Bieberbach groups. In particular we classify diffuse Bieberbach groups up to dimension 6. We also answer a question from [7, page 887] abo...	4
AN EXOTIC GROUP AS LIMIT OF FINITE SPECIAL LINEAR GROUPS arXiv:1603.00691v3 [] 29 May 2017 ALESSANDRO CARDERI AND ANDREAS THOM Abstract. We consider the Polish group obtained as the rank-completion of an inductive limit of finite special linear groups. This Polish group is topologically simple modulo its center, it i...	4
Extracting Ontological Knowledge from Textual Descriptions Kevin Alex Mathews P Sreenivasa Kumar Indian Institute of Technology Madras kevin@cse.iitm.ac.in Indian Institute of Technology Madras psk@cse.iitm.ac.in KEYWORDS Text Analytics, Ontology Learning, Knowledge Extraction 1 the input sentence without substa...	2
arXiv:0910.5833v1 [] 30 Oct 2009 From Single-thread to Multithreaded: An E ient Stati Analysis Algorithm Jean-Loup Carré Charles Hymans November 2, 2009 Abstra t A great variety of stati analyses that ompute safety properties of single-thread programs have now been developed. This paper presents a systemati method...	6
Efficiently Decodable Non-Adaptive Threshold Group Testing Thach V. Bui∗ , Minoru Kuribayashi‡ , Mahdi Cheraghchi§, and Isao Echizen∗† arXiv:1712.07509v3 [] 30 Jan 2018 ∗ SOKENDAI (The Graduate University for Advanced Studies), Hayama, Kanagawa, Japan bvthach@nii.ac.jp ‡ Graduate § Department of † National Institu...	7
Verifying Buchberger’s Algorithm in Reduction Rings arXiv:1604.08736v1 [cs.SC] 29 Apr 2016 Alexander Maletzky∗ Doctoral College “Computational Mathematics” and RISC Johannes Kepler University Linz, Austria alexander.maletzky@dk-compmath.jku.at Abstract In this paper we present the formal, computer-supported verifica...	0
Associative Array Model of SQL, NoSQL, and NewSQL Databases Jeremy Kepner1,2,3, Vijay Gadepally1,2, Dylan Hutchison4, Hayden Jananthan3,5, Timothy Mattson6, Siddharth Samsi1, Albert Reuther1 1 2 MIT Lincoln Laboratory, MIT Computer Science & AI Laboratory, 3MIT Mathematics Department, 4University of Washington Computer...	6
A critical analysis of some popular methods for the discretisation of the gradient operator in finite volume methods Alexandros Syrakos∗1 , Stylianos Varchanis1 , Yannis Dimakopoulos1 , Apostolos Goulas2 , and John Tsamopoulos1 1 arXiv:1606.05556v6 [cs.NA] 29 Dec 2017 Laboratory of Fluid Mechanics and Rheology, Dept....	5
Evol. Intel. manuscript No. (will be inserted by the editor) A semantic network-based evolutionary algorithm for computational creativity arXiv:1404.7765v2 [] 14 Jul 2014 Atılım Güneş Baydin · Ramon López de Mántaras · Santiago Ontañón Received: date / Accepted: date Abstract We introduce a novel evolutionar...	9
A SUPERVISED STDP-BASED TRAINING ALGORITHM FOR LIVING NEURAL NETWORKS Yuan Zeng∗ Kevin Devincentis† Yao Xiao‡ Zubayer Ibne Ferdous∗ Xiaochen Guo∗ Zhiyuan Yan∗ Yevgeny Berdichevsky∗§ arXiv:1710.10944v3 [] 21 Mar 2018 Lehigh University, ∗ Electrical and Computer Engineering Department § Bioengineering Department † Carn...	9
1 Dynamic Distributed Storage for Scaling Blockchains Ravi Kiran Raman and Lav R. Varshney arXiv:1711.07617v2 [] 7 Jan 2018 Abstract Blockchain uses the idea of storing transaction data in the form of a distributed ledger wherein each node in the network stores a current copy of the sequence of transactions in the f...	7
Explaining Constraint Programming Krzysztof R. Apt1,2,3 arXiv:cs/0602027v1 [] 7 Feb 2006 1 School of Computing, National University of Singapore 2 CWI, Amsterdam 3 University of Amsterdam, the Netherlands Abstract. We discuss here constraint programming (CP) by using a proof-theoretic perspective. To this end we id...	2
84 Cooperative Multi-Agent Planning: A Survey arXiv:1711.09057v1 [] 24 Nov 2017 ALEJANDRO TORREÑO, Universitat Politècnica de València EVA ONAINDIA, Universitat Politècnica de València ANTONÍN KOMENDA, Czech Technical University in Prague MICHAL ŠTOLBA, Czech Technical University in Prague Cooperative multi-a...	2
arXiv:1407.4546v7 [] 28 Sep 2016 The Annals of Statistics 2016, Vol. 44, No. 5, 1931–1956 DOI: 10.1214/15-AOS1375 c Institute of Mathematical Statistics, 2016 CRAMÉR-TYPE MODERATE DEVIATIONS FOR STUDENTIZED TWO-SAMPLE U -STATISTICS WITH APPLICATIONS By Jinyuan Chang1,∗,† , Qi-Man Shao2,‡ and Wen-Xin Zhou3,§,† Southw...	10
October 13, 2017 arXiv:1710.04207v1 [eess.IV] 11 Oct 2017 Algebraic Image Processing Enrico Celeghini Dipartimento di Fisica, Università di Firenze and INFN-Sezione di Firenze I50019 Sesto Fiorentino, Firenze, Italy. Departamento de Fı́sica Teórica, Atómica y Óptica and IMUVA. Universidad de Valladolid, 47011 Val...	1
Risk Minimization and Optimal Derivative Design in a Principal arXiv:0710.5512v1 [] 29 Oct 2007 Agent Game∗ Ulrich Horst Santiago Moreno-Bromberg Department of Mathematics Department of Mathematics Humboldt University Berlin University of British Columbia Unter den Linden 6 1984 Mathematics Road 10099 Berlin ...	5
1 Fast Greedy Approaches for Compressive Sensing of Large-Scale Signals Sung-Hsien Hsieh∗,∗∗, Chun-Shien Lu∗∗ , and Soo-Chang Pei∗ Inst. Comm. Eng., National Taiwan University, Taipei, Taiwan ∗∗ Institute of Information Science, Academia Sinica, Taipei, Taiwan arXiv:1509.03979v2 [] 17 Mar 2016 ∗ Graduate Abstract—C...	8
arXiv:1703.06460v1 [] 19 Mar 2017 Almost Buchsbaumness of some rings arising from complexes with isolated singularities Connor Sawaske Department of Mathematics University of Washington Seattle, WA 98195-4350, USA sawaske@math.washington.edu March 21, 2017 Abstract We study properties of the Stanley–Reisner rings of ...	0
1 Performance Analysis of Dynamic Channel Bonding in Spatially Distributed High Density WLANs arXiv:1801.00594v1 [cs.NI] 2 Jan 2018 Sergio Barrachina-Muñoz, Francesc Wilhelmi, Boris Bellalta Abstract—In this paper we discuss the effects on throughput and fairness of dynamic channel bonding (DCB) in spatially distri...	7
Comparison of channels: criteria for domination by a symmetric channel Anuran Makur and Yury Polyanskiy∗ arXiv:1609.06877v2 [] 22 Nov 2017 Abstract This paper studies the basic question of whether a given channel V can be dominated (in the precise sense of being more noisy) by a q-ary symmetric channel. The concept o...	10
On Time-Bandwidth Product of Multi-Soliton Pulses Alexander Span∗, Vahid Aref† , Henning Bülow† , and Stephan ten Brink∗ arXiv:1705.09468v1 [] 26 May 2017 ∗ Institute of Telecommunications, University of Stuttgart, Stuttgart, Germany † Nokia Bell Labs, Stuttgart, Germany Abstract—Multi-soliton pulses are potential...	7
Logical Methods in Computer Science Vol. 8 (2:18) 2012, pp. 1–42 www.lmcs-online.org Submitted Published Oct. 19, 2011 Jun. 28, 2012 SOFTWARE MODEL CHECKING WITH EXPLICIT SCHEDULER AND SYMBOLIC THREADS ALESSANDRO CIMATTI, IMAN NARASAMDYA, AND MARCO ROVERI Fondazione Bruno Kessler e-mail address: {cimatti,narasamdya,...	6
ACCEPTED FOR PUBLICATION, IEEE TRANSACTIONS ON SIGNAL PROCESSING 1 Multiple scan data association by convex variational inference (extended version) arXiv:1607.07942v2 [] 23 Jan 2018 Jason L. Williams, Senior Member, IEEE and Roslyn A. Lau, Student Member, IEEE Abstract—Data association, the reasoning over corresp...	2
1 Sharing Storage in a Smart Grid: A Coalitional Game Approach arXiv:1712.02909v1 [] 8 Dec 2017 Pratyush Chakraborty∗, Enrique Baeyens∗, Kameshwar Poolla, Pramod P. Khargonekar, and Pravin Varaiya Abstract—Sharing economy is a transformative socio-economic phenomenon built around the idea of sharing underused resou...	3
From Imitation to Prediction, Data Compression vs Recurrent Neural Networks for Natural Language Processing Juan Andrés Laura∗ , Gabriel Masi† and Luis Argerich‡ arXiv:1705.00697v1 [cs.CL] 1 May 2017 Departemento de Computación, Facultad de Ingenierı́a Universidad de Buenos Aires Email: ∗ jandreslaura@gmail.com, † ...	2
Characterizations and Effective Computation of Supremal Relatively Observable Sublanguages* arXiv:1609.02251v1 [] 8 Sep 2016 Kai Cai1 and Renyuan Zhang2 , W.M. Wonham3 Abstract Recently we proposed relative observability for supervisory control of discrete-event systems under partial observation. Relative observabil...	3
PROPERTIES OF EXTENDED ROBBA RINGS arXiv:1709.06221v1 [math.NT] 19 Sep 2017 PETER WEAR Abstract. We extend the analogy between the extended Robba rings of p-adic Hodge theory and the one-dimensional affinoid algebras of rigid analytic geometry, proving some fundamental properties that are well known in the latter ca...	0
arXiv:1510.08517v1 [cs.LO] 28 Oct 2015 Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs ∗ Krishnendu Chatterjee Hongfei Fu † Petr Novotný IST Austria Krishnendu.Chatterjee@ist.ac.at IST Austria State Key Laboratory of Computer Science, Institute of Softwa...	6
Gabora, L. (1992). Should I stay or should I go: Coordinating biological needs with continuously-‐updated assessments of the environment: A computer model. In (S. Wilson, J. A. Mayer & H. Roitblat, Eds.) Proceedings of...	9
arXiv:1610.07253v1 [] 24 Oct 2016 DUAL ORE’S THEOREM FOR DISTRIBUTIVE INTERVALS OF SMALL INDEX SEBASTIEN PALCOUX Abstract. This paper proves a dual version of a theorem of Oystein Ore for every distributive interval of finite groups [H, G] of index \|G : H\| < 9720, and for every boolean interval of rank < 7. It has app...	4
arXiv:1303.5532v1 [] 22 Mar 2013 N6 PROPERTY FOR THIRD VERONESE EMBEDDINGS THANH VU Abstract. The rational homology groups of the matching complexes are closely related to the syzygies of the Veronese embeddings. In this paper we will prove the vanishing of certain rational homology groups of matching complexes, thus ...	0
A Classical Realizability Model for a Semantical Value Restriction arXiv:1603.07484v2 [cs.LO] 7 Apr 2016 Rodolphe Lepigre LAMA, UMR 5127 - CNRS Université Savoie Mont Blanc, France rodolphe.lepigre@univ-smb.fr Abstract. We present a new type system with support for proofs of programs in a call-by-value language wit...	6
Accelerating Deep Learning with Memcomputing Haik Manukian1 , Fabio L. Traversa2 , Massimiliano Di Ventra1 arXiv:1801.00512v2 [cs.LG] 24 Jan 2018 Abstract Restricted Boltzmann machines (RBMs) and their extensions, called “deep-belief networks”, are powerful neural networks that have found applications in the fields o...	2
COMPUTING UPPER CLUSTER ALGEBRAS arXiv:1307.0579v1 [] 2 Jul 2013 JACOB MATHERNE AND GREG MULLER Abstract. This paper develops techniques for producing presentations of upper cluster algebras. These techniques are suited to computer implementation, and will always succeed when the upper cluster algebra is totally copr...	0
A Simple Convex Layers Algorithm Raimi A. Rufai1 and Dana S. Richards2 arXiv:1702.06829v2 [cs.CG] 16 Mar 2017 1 SAP Labs, 111 rue Duke, Suite 9000, Montreal QC H3C 2M1, Canada raimi.rufai@sap.com 2 Department of Computer Science, George Mason University, 4400 University Drive MSN 4A5, Fairfax, VA 22030, USA richards...	8
arXiv:1705.01838v1 [math.AG] 4 May 2017 ON PERMUTATIONS INDUCED BY TAME AUTOMORPHISMS OVER FINITE FIELDS KEISUKE HAKUTA Abstract. The present paper deals with permutations induced by tame automorphisms over finite fields. The first main result is a formula for determining the sign of the permutation induced by a given...	0
ZU064-05-FPR paper-jfp 6 February 2018 3:38 Under consideration for publication in J. Functional Programming 1 arXiv:1406.5106v1 [] 19 Jun 2014 Pushdown flow analysis with abstract garbage collection J. IAN JOHNSON Northeastern University ILYA SERGEY IMDEA Software Institute CHRISTOPHER EARL University of Utah M...	6
On the frequentist validity of Bayesian limits B. J. K. Kleijn∗ Korteweg-de Vries Institute for Mathematics, University of Amsterdam arXiv:1611.08444v3 [] 27 Nov 2017 November 2017 Abstract To the frequentist who computes posteriors, not all priors are useful asymptotically: in this paper Schwartz’s 1965 Kullback-Lei...	10
Stochastic Runtime Analysis of a Cross-Entropy Algorithm for Traveling Salesman Problems Zijun Wua,1,∗, Rolf H. Möhringb,2,∗∗, Jianhui Laic, arXiv:1612.06962v2 [] 11 Oct 2017 a Beijing Institute for Scientific and Engineering Computing (BISEC), Pingle Yuan 100, Beijing, P. R. China b Beijing Institute for Scientifi...	8
arXiv:1508.04596v1 [physics.flu-dyn] 19 Aug 2015 Large scale three-dimensional topology optimisation of heat sinks cooled by natural convection Joe Alexandersena,∗, Ole Sigmunda , Niels Aagea a Department of Mechanical Engineering, Solid Mechanics Technical University of Denmark Nils Koppels Allé, Building 404 DK-28...	5
A note on the Survivable Network Design Problem Chandra Chekuri∗ Thapanapong Rukkanchanunt† arXiv:1608.02515v1 [] 8 Aug 2016 August 9, 2016 Abstract In this note we consider the survivable network design problem (SNDP) in undirected graphs. We make two contributions. The first is a new counting argument in the iter...	8
Ensembling Neural Networks for Digital Pathology Images Classification and Segmentation Gleb Makarchuk?1,3 , Vladimir Kondratenko1,3 , Maxim Pisov1,3 , Artem Pimkin*1,3 , Egor Krivov1,2,3 , and Mikhail Belyaev2,1 arXiv:1802.00947v1 [] 3 Feb 2018 1 Kharkevich Institute for Information Transmission Problems, Moscow,...	1
Iterative Residual Fitting for Spherical Harmonic Transform of Band-Limited Signals on the Sphere: Generalization and Analysis Usama Elahi∗ , Zubair Khalid† , Rodney A. Kennedy∗ and Jason D. McEwen‡ † Research School of Engineering, The Australian National University, Canberra, ACT 2601, Australia of Science and Engin...	7
INITIAL MONOMIAL INVARIANTS OF HOLOMORPHIC MAPS arXiv:1502.03434v3 [math.CV] 9 Sep 2015 DUSTY GRUNDMEIER AND JIŘÍ LEBL Abstract. We study a new biholomorphic invariant of holomorphic maps between domains in different dimensions based on generic initial ideals. We start with the standard generic monomial ideals to f...	0
1 Codes Correcting Two Deletions Ryan Gabrys∗ and Frederic Sala† ∗ Spawar † University Systems Center ryan.gabrys@navy.mil of California, Los Angeles fredsala@ucla.edu Abstract I. I NTRODUCTION This paper is concerned with deletion-correcting codes. The problem of creating error-correcting codes that correct one ...	7
1 On Binary Distributed Hypothesis Testing Eli Haim and Yuval Kochman arXiv:1801.00310v1 [] 31 Dec 2017 Abstract We consider the problem of distributed binary hypothesis testing of two sequences that are generated by an i.i.d. doubly-binary symmetric source. Each sequence is observed by a different terminal. The two...	7
arXiv:1511.07607v2 [cs.MM] 27 Sep 2017 Fine-Grain Annotation of Cricket Videos Rahul Anand Sharma CVIT, IIIT-Hyderabad Hyderabad, India Pramod Sankar K. Xerox Research Center India Bengaluru, India C. V. Jawahar CVIT, IIIT-Hyderabad Hyderabad, India rahul.anand@research.iiit.ac.in pramod.kompalli@xerox.com jawaha...	1
How morphological development can guide evolution Sam Kriegman1,* , Nick Cheney2 , and Josh Bongard1 1 University of Vermont, Department of Computer Science, Burlington, VT, USA of Wyoming, Department of Computer Science, Laramie, WY, USA * sam.kriegman@uvm.edu arXiv:1711.07387v2 [q-bio.PE] 15 Dec 2017 2 University ...	2
Gradient Descent with Random Initialization: Fast Global Convergence for Nonconvex Phase Retrieval Yuxin Chen∗ Yuejie Chi† Jianqing Fan‡ Cong Ma‡ arXiv:1803.07726v1 [stat.ML] 21 Mar 2018 March 2018 Abstract This paper considers the problem of solving systems of quadratic equations, namely, recovering an \ 2 objec...	7
Preventing Atomicity Violations with Contracts Diogo G. Sousa Ricardo J. Dias Carla Ferreira João M. Lourenço arXiv:1505.02951v1 [cs.DC] 12 May 2015 NOVA LINCS — NOVA Laboratory for Computer Science and Informatics Departamento de Informática, Faculdade de Ciências e Tecnologia Universidade NOVA de Lisboa, Portuga...	6
SYMMETRIC AUTOMORPHISMS OF FREE GROUPS, BNSR-INVARIANTS, AND FINITENESS PROPERTIES arXiv:1607.03043v1 [] 11 Jul 2016 MATTHEW C. B. ZAREMSKY Abstract. The BNSR-invariants of a group G are a sequence Σ1 (G) ⊇ Σ2 (G) ⊇ · · · of geometric invariants that reveal important information about finiteness properties of certain...	4
EFFICIENT COMPRESSION OF PROLOG PROGRAMS Alin-Dumitru Suciu Technical University of Cluj-Napoca, Department of Computer Science 26-28, George Bariţiu St., RO-3400, Cluj-Napoca, Romania Phone/Fax: +40-64-194491, Email: Alin.Suciu@cs.utcluj.ro Kálmán Pusztai Technical University of Cluj-Napoca, Department of Computer Sc...	2
F -SINGULARITIES VIA ALTERATIONS arXiv:1107.3807v4 [math.AG] 5 May 2014 MANUEL BLICKLE, KARL SCHWEDE, KEVIN TUCKER Abstract. We give characterizations of test ideals and F -rational singularities via (regular) alterations. Formally, the descriptions are analogous to standard characterizations of multiplier ideals an...	0
1 L ATTICE E RASURE C ODES OF L OW R ANK WITH N OISE M ARGINS Vinay A. Vaishampayan arXiv:1801.04466v1 [] 13 Jan 2018 Dept. of Engineering Science and Physics City University of New York-College of Staten Island Staten Island, NY USA Abstract We consider the following generalization of an (n, k) MDS code for appl...	7
Standard detectors aren’t (currently) fooled by physical adversarial stop signs arXiv:1710.03337v2 [] 26 Oct 2017 Jiajun Lu, Hussein Sibai, Evan Fabry, David Forsyth University of Illinois at Urbana Champaign {jlu23, sibai2, efabry2, daf}@illinois.edu Abstract classified) or not [20, 8, 21, 12, 2, 4]. Current proce...	2
ARTINIAN LEVEL ALGEBRAS OF SOCLE DEGREE 4 arXiv:1701.03180v1 [] 11 Jan 2017 SHREEDEVI K. MASUTI AND M. E. ROSSI A BSTRACT. In this paper we study the O-sequences of the local (or graded) K-algebras of socle degree 4. More precisely, we prove that an O-sequence h = (1, 3, h2 , h3 , h4 ), where h4 ≥ 2, is the h-vector ...	0
Reconfigurable Antenna Multiple Access for 5G mmWave Systems Mojtaba Ahmadi Almasi∗ , Hani Mehrpouyan∗, David Matolak∗∗ , Cunhua Pan†, Maged Elkashlan† ∗ Department of Electrical and Computer Engineering, Boise State University, {mojtabaahmadialm,hanimehrpouyan}@boisestate.edu ∗∗ Department of Electrical Engineering, U...	7
Ensemble Estimation of Mutual Information Kevin R. Moon1 , Kumar Sricharan2 , and Alfred O. Hero III3,* arXiv:1701.08083v1 [] 27 Jan 2017 1 Department of Genetics, Yale University — 2 Xerox PARC — 3 EECS Department, University of Michigan Abstract—We derive the mean squared error convergence rates of kernel density...	10
End-to-end Training for Whole Image Breast Cancer Diagnosis using An All Convolutional Design Li Shen Icahn School of Medicine at Mount Sinai New York, NY 10029 li.shen@mssm.edu, shenli.sam@gmail.com Abstract We develop an end-to-end training algorithm for whole-image breast cancer diagnosis based on mammograms. It re...	7
Towards the 1G of Mobile Power Network: RF, Signal and System Designs to Make Smart Objects Autonomous Bruno Clerckx1, Alessandra Costanzo2, Apostolos Georgiadis3, and Nuno Borges Carvalho4 1 Imperial College London, UK, 2University of Bologna, Italy, 3Heriot-Watt University, UK, 4 University of Aveiro, Portugal Email...	7
EXTREMES OF THRESHOLD-DEPENDENT GAUSSIAN PROCESSES LONG BAI, KRZYSZTOF DȨBICKI, ENKELEJD HASHORVA, AND LANPENG JI arXiv:1701.05387v1 [math.PR] 19 Jan 2017 n o Abstract: In this contribution we are concerned with the asymptotic behaviour, as u → ∞, of P supt∈[0,T ] Xu (t) > u , where Xu (t), t ∈ [0, T ], u > 0 is na...	10
Selection from heaps, row-sorted matrices and X + Y using soft heaps arXiv:1802.07041v1 [] 20 Feb 2018 Haim Kaplan ∗ László Kozma † Or Zamir ‡ Uri Zwick § Abstract We use soft heaps to obtain simpler optimal algorithms for selecting the k-th smallest item, and the set of k smallest items, from a heap-ordere...	8
arXiv:1707.08197v2 [] 26 Sep 2017 Fast Label Extraction in the CDAWG Djamal Belazzougui1 and Fabio Cunial2 1 2 DTISI, CERIST Research Center, Algiers, Algeria. Max Planck Institute of Molecular Cell Biology and Genetics, Dresden, Germany. September 27, 2017 Abstract The compact directed acyclic word graph (CDAWG) of...	8
Synchronization Strings: Explicit Constructions, Local Decoding, and Applications∗. arXiv:1710.09795v2 [] 10 Nov 2017 Bernhard Haeupler Carnegie Mellon University haeupler@cs.cmu.edu Amirbehshad Shahrasbi Carnegie Mellon University shahrasbi@cs.cmu.edu Abstract This paper gives new results for synchronization strin...	7
Variance reduction for antithetic integral control of stochastic reaction networks arXiv:1711.08291v1 [math.OC] 22 Nov 2017 Corentin Briat∗, Ankit Gupta∗, Mustafa Khammash† Department of Biosystems Science and Engineering, ETH-Zürich, Switzerland Abstract The antithetic integral feedback motif recently introduced i...	3
Data-Aided Secure Massive MIMO Transmission with Active Eavesdropping arXiv:1801.07076v1 [] 22 Jan 2018 Yongpeng Wu, Chao-Kai Wen, Wen Chen, Shi Jin, Robert Schober, and Giuseppe Caire Abstract—In this paper, we study the design of secure communication for time division duplexing multi-cell multi-user massive multip...	7
Multi-scale Deep Learning Architectures for Person Re-identification arXiv:1709.05165v1 [] 15 Sep 2017 Xuelin Qian1 Yanwei Fu2,5, * Yu-Gang Jiang1,3 Tao Xiang4 Xiangyang Xue1,2 1 Shanghai Key Lab of Intelligent Info. Processing, School of Computer Science, Fudan University; 2 School of Data Science, Fudan University;...	1
Low-dimensional Data Embedding via Robust Ranking Ehsan Amid Nikos Vlassis Manfred K. Warmuth University of California, Santa Cruz, CA 95064 eamid@ucsc.edu Adobe Research San Jose, CA 95113 vlassis@adobe.com University of California, Santa Cruz, CA 95064 manfred@ucsc.edu arXiv:1611.09957v2 [] 16 May 2017 ABSTRAC...	2
A LAX MONOIDAL TOPOLOGICAL QUANTUM FIELD THEORY FOR REPRESENTATION VARIETIES ÁNGEL GONZÁLEZ-PRIETO, MARINA LOGARES AND VICENTE MUÑOZ arXiv:1709.05724v1 [math.AG] 17 Sep 2017 Abstract. We construct a lax monoidal Topological Quantum Field Theory that computes Deligne-Hodge polynomials of representation varieties of...	0
Randomised enumeration of small witnesses using a decision oracle Kitty Meeks∗ School of Computing Science, University of Glasgow arXiv:1509.05572v4 [] 4 Jan 2018 kitty.meeks@glasgow.ac.uk January 2018 Abstract Many combinatorial problems involve determining whether a universe of n elements contains a witness consi...	8
IEEE TRANSACTIONS ON MULTIMEDIA , VOL. ?, NO. ?, ? 2018 1 Predicting Visual Features from Text for Image and Video Caption Retrieval arXiv:1709.01362v2 [] 29 Jan 2018 Jianfeng Dong, Xirong Li*, and Cees G. M. Snoek Abstract—This paper strives to find amidst a set of sentences the one best describing the content of...	1
Conditioning in Probabilistic Programming Nils Jansen and Benjamin Lucien Kaminski and Joost-Pieter Katoen and Federico Olmedo Friedrich Gretz and Annabelle McIver Macquarie University Sydney, Australia arXiv:1504.00198v1 [] 1 Apr 2015 RWTH Aachen University Aachen, Germany Abstract—We investigate the semantic intr...	6
A Covert Queueing Channel 1 in FCFS Schedulers AmirEmad Ghassami and Negar Kiyavash arXiv:1707.07234v1 [] 23 Jul 2017 Abstract We study covert queueing channels (CQCs), which are a kind of covert timing channel that may be exploited in shared queues across supposedly isolated users. In our system model, a user modu...	7
Abstract Learning via Demodulation in a Deep Neural Network Andrew J.R. Simpson #1 # Centre for vision, speech and signal processing (CVSSP), University of Surrey, Guildford, Surrey, UK 1 Andrew.Simpson@Surrey.ac.uk Abstract—Inspired by the brain, deep neural networks (DNN) are thought to learn abstract representati...	9
arXiv:1410.7051v6 [] 21 Jul 2017 TWISTED CONJUGACY IN HOUGHTON’S GROUPS CHARLES GARNET COX Abstract. For a fixed n ∈ {2, 3, . . .}, the Houghton group Hn consists of bijections of Xn = {1, . . . , n} × N that are ‘eventually translations’ of each copy of N. The Houghton groups have been shown to have solvable conjugac...	4
Bayesian GAN arXiv:1705.09558v3 [stat.ML] 8 Nov 2017 Yunus Saatchi Uber AI Labs Andrew Gordon Wilson Cornell University Abstract Generative adversarial networks (GANs) can implicitly learn rich distributions over images, audio, and data which are hard to model with an explicit likelihood. We present a practical Bay...	1
Online Algorithms for Multi-Level Aggregation∗ Marcin Bienkowski† Christoph Dürr¶ Martin Böhm‡ Jaroslaw Byrka† Marek Chrobak§ Lukáš Folwarczný‡ Lukasz Jeż† Jiřı́ Sgall‡ Nguyen Kim Thangk Pavel Veselý‡ arXiv:1507.02378v3 [] 28 Dec 2016 December 30, 2016 Abstract In the Multi-Level Aggregation Problem (MLAP)...	8
A Message Passing Approach for Decision Fusion in Adversarial Multi-Sensor Networks Andrea Abrardo, Mauro Barni, Kassem Kallas and Benedetta Tondia arXiv:1702.08357v1 [] 27 Feb 2017 a Department of Information Engineering and Mathematics, Via Roma 56, Siena, Italy Abstract We consider a simple, yet widely studied, ...	3
arXiv:1704.08165v1 [stat.ML] 26 Apr 2017 A Generalization of Convolutional Neural Networks to Graph-Structured Data Yotam Hechtlinger, Purvasha Chakravarti & Jining Qin Department of Statistics Carnegie Mellon University {yhechtli,pchakrav,jiningq}@stat.cmu.edu April 27, 2017 Abstract This paper introduces a generaliz...	2
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem arXiv:1604.08147v1 [] 27 Apr 2016 Fritz Bökler and Petra Mutzel Department of Computer Science, TU Dortmund, Germany {fritz.boekler, petra.mutzel}@tu-dortmund.de Abstract. In this paper, we re-evaluate the basic strateg...	8

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.