Split (3)

train · 27.2k rows

text stringlengths 2.85k 2.55M	label int64 0 10
Social Aggregation 1 Simplicial models of social aggregation I Mirco A. Mannucci, Lisa Sparks, Daniele C. Struppa This article is dedicated to the memory of Jonathan M. Beck (d. 2006), who taught one of us to search for the hidden, endless treasures of the simplicial ladder. Abstract This paper presents the founda...	5
On the Maximal Halfspace Depth of Permutation-invariant Distributions on the Simplex arXiv:1705.04974v2 [math.ST] 21 Jun 2017 Davy Paindaveine1 , Germain Van Bever Université libre de Bruxelles, ECARES and Département de Mathématique, CP 114/04, 50, Avenue F.D. Roosevelt, B-1050 Brussels, Belgium Abstract We comp...	10
A Gradient Descent Technique Coupled with a Dynamic Simulation to Determine the Near Optimum Orientation of Floor Plan Designs Eugénio Rodrigues#1, Adélio Rodrigues Gaspar#2, Álvaro Gomes*3 # ADAI–LAETA, Department of Mechanical Engineering, University of Coimbra Rua Luís Reis Santos, Pólo II, 3030-788 Coimbra, Portug...	5
The geometry of characters of Hopf algebras arXiv:1704.01099v4 [math.GR] 27 Sep 2017 Geir Bogfjellmo and Alexander Schmeding Abstract Character groups of Hopf algebras can be used to conveniently describe several species of “series expansions” such as ordinary Taylor series, B-series, arising in the study of ordinar...	4
Covariance Functions for Multivariate Gaussian Fields Evolving Temporally Over Planet Earth arXiv:1701.06010v2 [math.ST] 21 Nov 2017 Alfredo Alegrı́a1 , Emilio Porcu1,2 , Reinhard Furrer3 and Jorge Mateu4 1 School of Mathematics & Statistics, Newcastle University, Newcastle Upon Tyne, United Kingdom. 2 Departamento ...	10
Adaptive local surface refinement based on LR NURBS and its application to contact Christopher Zimmermann, Roger A. Sauer1 Aachen Institute for Advanced Study in Computational Engineering Science (AICES), RWTH Aachen University, Templergraben 55, 52062 Aachen, Germany Published2 in Computational Mechanics, DOI: 10.1007...	5
Cyclic Codes over the Matrix Ring M2(Fp) and Their Isometric Images over Fp2 + uFp2 ∗ arXiv:1409.7228v2 [cs.IT] 29 Jun 2017 Dixie Falcunit, Jr. IMSP, UP Los Baños College 4031, Laguna, Philippines e-mail: dffalcunitjr@uplb.edu.ph Virgilio Sison† IMSP, UP Los Baños College 4031, Laguna, Philippines e-mail: vpsison@u...	7
Can Machines Truly Think? Murat Okandan Sandia National Laboratories, PO Box 5800 MS1080, Albuquerque, NM 87185 mokanda@sandia.gov Can machines truly think? This question and its answer have many implications that depend, in large part, on any number of assumptions underlying how the issue has been addressed or consid...	9
DeepLung: 3D Deep Convolutional Nets for Automated Pulmonary Nodule Detection and Classification Wentao Zhu, Chaochun Liu, Wei Fan, Xiaohui Xie arXiv:1709.05538v1 [cs.CV] 16 Sep 2017 University of California, Irvine and Baidu Research {wentaoz1,xhx}@ics.uci.edu and {liuchaochun,fanwei03}@baidu.com Abstract In this w...	1
arXiv:1109.4593v2 [math.AC] 1 Aug 2012 HILBERT DEPTH OF GRADED MODULES OVER POLYNOMIAL RINGS IN TWO VARIABLES JULIO JOSÉ MOYANO-FERNÁNDEZ AND JAN ULICZKA Abstract. In this article we mainly consider the positively Z– graded polynomial ring R = F[X, Y ] over an arbitrary field F and Hilbert series of finitely generat...	0
From analytical mechanical problems to rewriting theory through M. Janet arXiv:1801.00053v1 [math.HO] 29 Dec 2017 Kenji Iohara Philippe Malbos Abstract – This note surveys the historical background of the Gröbner basis theory for D-modules and linear rewriting theory. The objective is to present a deep interaction ...	0
The Semantics of Graph Programs Detlef Plump Sandra Steinert Department of Computer Science The University of York, UK Department of Computer Science The University of York, UK GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, f...	6
Published as a conference paper at ICLR 2018 M EMORY AUGMENTED C ONTROL N ETWORKS Arbaaz Khan, Clark Zhang, Nikolay Atanasov, Konstantinos Karydis, Vijay Kumar, Daniel D. Lee GRASP Laboratory, University of Pennsylvania arXiv:1709.05706v6 [cs.AI] 14 Feb 2018 A BSTRACT Planning problems in partially observable enviro...	2
Statistical estimation of the Oscillating Brownian Motion Antoine Lejay∗ Paolo Pigato† arXiv:1701.02129v1 [math.PR] 9 Jan 2017 January 10, 2017 Abstract We study the asymptotic behavior of estimators of a two-valued, discontinuous diffusion coefficient in a Stochastic Differential Equation, called an Oscillating Br...	10
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem arXiv:1511.04387v2 [cs.DS] 8 Sep 2016 Shahriar Astaa , Daniel Karapetyana,b,∗, Ahmed Kheiria , Ender Özcana , Andrew J. Parkesa a University of Nottingham, School of Computer Science Jubilee Cam...	8
arXiv:1802.10277v1 [math.AC] 28 Feb 2018 DEGENERATIONS OVER (A∞ )-SINGULARITIES AND CONSTRUCTION OF DEGENERATIONS OVER COMMUTATIVE RINGS NAOYA HIRAMATSU, RYO TAKAHASHI, AND YUJI YOSHINO Abstract. We give a necessary condition of degeneration via matrix representations, and consider degenerations of indecomposable Cohe...	0
DIFFERENCE BASES IN DIHEDRAL GROUPS arXiv:1704.02472v2 [math.CO] 13 Apr 2017 TARAS BANAKH AND VOLODYMYR GAVRYLKIV Abstract. A subset B of a group G is called a difference basis of G if each element g ∈ G can be written as the difference g = ab−1 of some elements a, b ∈ B. The smallest cardinality \|B\| ofpa difference ...	4
arXiv:1706.04387v1 [math.GR] 14 Jun 2017 TOPOLOGICAL FINITENESS PROPERTIES OF MONOIDS PART 1: FOUNDATIONS ROBERT D. GRAY AND BENJAMIN STEINBERG Abstract. We initiate the study of higher dimensional topological finiteness properties of monoids. This is done by developing the theory of monoids acting on CW complexes. Fo...	4
Distilling Abstract Machines (Long Version) Beniamino Accattoli Pablo Barenbaum Damiano Mazza arXiv:1406.2370v1 [cs.PL] 9 Jun 2014 January 16, 2018 Abstract It is well-known that many environment-based abstract machines can be seen as strategies in lambda calculi with explicit substitutions (ES). Recently, graphica...	6
Model Checking Gene Regulatory Networks ? Mirco Giacobbe∗ , Călin C. Guet∗ , Ashutosh Gupta∗† , Thomas A. Henzinger∗ , Tiago Paixão∗ , and Tatjana Petrov∗ arXiv:1410.7704v2 [cs.CE] 16 Jan 2015 IST Austria, Austria∗ TIFR, India† Abstract. The behaviour of gene regulatory networks (GRNs) is typically analysed usi...	5
Deterministic Perturbations For Simultaneous Perturbation Methods Using Circulant Matrices. arXiv:1702.06250v2 [cs.SY] 15 Mar 2017 Chandramouli K ] , D. Sai Koti Reddy† , Shalabh Bhatnagar‡ Abstract— We consider the problem of finding optimal parameters under simulation optimization setup. For a pdimensional paramete...	3
Adaptive Rejection of Periodic Disturbances Acting on Linear Systems with Unknown Dynamics arXiv:1603.05361v1 [cs.SY] 17 Mar 2016 Behrooz Shahsavari, Jinwen Pan and Roberto Horowitz dynamics when the poles are on or very close to the stability boundary [16]. Another limitation of IMP based repetitive control is that ...	3
Understanding Deep Architectures by Interpretable Visual Summaries Marco Carletti∗ , Marco Godi∗ , Maedeh Aghaei† and Marco Cristani∗ ∗ University † University of Verona, Italy; Email: name.surname@univr.it of Barcelona, Spain; Email: aghaei.maya@gmail.com Summary 1 Summary 2 Summary 3 robin arXiv:1801.09103v1 [c...	1
arXiv:1411.6719v3 [math.ST] 1 May 2016 Asymptotically Optimal Discrete Time Nonlinear Filters From Stochastically Convergent State Process Approximations Dionysios S. Kalogerias and Athina P. Petropulu May 2016 Abstract We consider the problem of approximating optimal in the Minimum Mean Squared Error (MMSE) sense non...	3
Experimental Astronomyo - DOI: 10.1007/s10686-011-9241-6 manuscript No. (will be inserted by the editor) Using Java for distributed computing in the Gaia satellite data processing arXiv:1108.0355v1 [cs.CE] 1 Aug 2011 William O’Mullane1 , Xavier Luri2 , Paul Parsons3 , Uwe Lammers1 , John Hoar1 , Jose Hernandez1 the...	5
Finite element model based on refined plate theories for laminated glass units Alena Zemanová1 , Jan Zeman1,2 , and Michal Šejnoha1 1 arXiv:1410.8674v1 [cs.CE] 31 Oct 2014 Department of Mechanics, Faculty of Civil Engineering, Czech Technical University in Prague, Thákurova 7, 166 29 Prague 6, Czech Republic 2 Cen...	5
arXiv:1708.04419v1 [math.OC] 15 Aug 2017 DISCRETE TIME PONTRYAGIN MAXIMUM PRINCIPLE FOR OPTIMAL CONTROL PROBLEMS UNDER STATE-ACTION-FREQUENCY CONSTRAINTS PRADYUMNA PARUCHURI AND DEBASISH CHATTERJEE Abstract. We establish a Pontryagin maximum principle for discrete time optimal control problems under the following thr...	3
arXiv:1712.08111v1 [astro-ph.IM] 21 Dec 2017 Improving science yield for NASA Swift with automated planning technologies Aaron Tohuvavohu Swift Mission Operations Center Department of Astronomy and Astrophysics, The Pennsylvania State University University Park, PA 16802 E-mail: aaronb@swift.psu.edu Abstract. The Swif...	3
A new hierarchy for automaton semigroups Laurent Bartholdi1 , Thibault Godin2 , Ines Klimann3 , and Matthieu Picantin3 arXiv:1803.09991v1 [cs.FL] 27 Mar 2018 1 École Normale Supérieure, Paris, and Georg-August-Universität zu Göttingen, laurent.bartholdi@ens.fr, 2 University of Turku, Turku, thibault.godin@utu.fi...	4
arXiv:1404.4045v1 [math.AC] 15 Apr 2014 GAUSSIAN PROPERTY IN AMALGAMATED ALGEBRAS ALONG AN IDEAL NAJIB MAHDOU AND MOUTU ABDOU SALAM MOUTUI Abstract. Let f : A → B be a ring homomorphism and J be an ideal of B. In this paper, we investigate the transfer of Gaussian property to the amalgamation of A with B along J with...	0
Controllability of networked MIMO systems ⋆ Lin Wang a, Guanrong Chen b, Xiaofan Wang a, Wallace K. S. Tang b arXiv:1505.01255v4 [cs.SY] 31 Oct 2015 a Department of Automation, Shanghai Jiao Tong University, and Key Laboratory of System Control and Information Processing, Ministry of Education, Shanghai, China b De...	3
arXiv:1209.1711v2 [cs.PL] 9 Jan 2018 Programming Languages for Scientific Computing Matthew G. Knepley Computation Institute University of Chicago, Chicago, IL knepley@ci.uchicago.edu January 10, 2018 1 Introduction Scientific computation is a discipline that combines numerical analysis, physical understanding, al...	5
Capacity of Molecular Channels with Imperfect Particle-Intensity Modulation and Detection Nariman Farsad∗ , Christopher Rose† , Muriel Médard‡ , and Andrea Goldsmith∗ arXiv:1705.08040v1 [cs.IT] 22 May 2017 ∗ EE, Stanford University, † School of Engineering, Brown University, Abstract—This work introduces the par...	7
Distributed Nonlinear Observer with Robust Performance - A Circle Criterion Approach arXiv:1604.03014v2 [cs.SY] 12 Apr 2016 Jingbo Wu, Frank Allgöwer Institute for Systems Theory and Automatic Control, University of Stuttgart, 70550 Stuttgart, Germany (e-mail: {jingbo.wu, allgower}@ ist.uni-stuttgart.de) Abstract I...	3
arXiv:1312.6184v7 [cs.LG] 11 Oct 2014 Do Deep Nets Really Need to be Deep? * Draft for NIPS 2014 (not camera ready copy) * Rich Caruana Microsoft Research rcaruana@microsoft.com Lei Jimmy Ba University of Toronto jimmy@psi.utoronto.ca Abstract Currently, deep neural networks are the state of the art on problems ...	9
arXiv:1403.0541v1 [cs.AI] 3 Mar 2014 Representing, Reasoning and Answering Questions About Biological Pathways - Various Applications Saadat Anwar Arizona State University, Tempe, AZ 85233 USA sanwar@asu.edu March 4, 2014 Abstract Biological organisms are made up of cells containing numerous interconnected biochemic...	5
arXiv:1709.08853v4 [cs.LG] 8 Oct 2017 Object-oriented Neural Programming (OONP) for Document Understanding Zhengdong Lu1 Haotian Cui2 * Xianggen Liu2 * Yukun Yan2 * Daqi Zheng1 1 DeeplyCurious.ai {luz,da}@deeplycurious.ai 2 Department of Bio-medical Engineering, Tsinghua University {cht15, liuxg16, yanyk13}@mails.tsin...	9
1 Distributed Rate and Power Control in Vehicular Networks arXiv:1511.01535v1 [cs.SY] 4 Nov 2015 Jubin Jose, Chong Li, Xinzhou Wu, Lei Ying and Kai Zhu Abstract—The focus of this paper is on the rate and power control algorithms in Dedicated Short Range Communication (DSRC) for vehicular networks. We first propose ...	3
1 StackGAN++: Realistic Image Synthesis with Stacked Generative Adversarial Networks arXiv:1710.10916v2 [cs.CV] 25 Dec 2017 Han Zhang∗ , Tao Xu, Hongsheng Li, Shaoting Zhang, Senior Member, IEEE, Xiaogang Wang, Member, IEEE, Xiaolei Huang, Member, IEEE, Dimitris N. Metaxas, Fellow, IEEE Abstract—Although Generative ...	1
arXiv:1604.06359v1 [math.GR] 21 Apr 2016 p-quotients of the G.Higman group L. Glebsky February 19, 2018 Abstract These notes are based on the mini-course “On the Graham Higman group”, given at the Erwin Schrödinger Institute in Vienna, January 20, 22, 27 and 29, 2016, as a part of the Measured Group Theory program.1 ...	4
arXiv:1510.03611v2 [math.RT] 15 Feb 2018 Restriction of representations of GL(n + 1, C) to GL(n, C) and action of the Lie overalgebra Yury A. Neretin 1 1 The statement Abstract. Consider a restriction of an irreducible finite dimensional holomorphic representation of GL(n + 1, C) to the subgroup GL(n, C). We write ...	4
arXiv:1511.00824v3 [math.CT] 30 Dec 2016 CENTRAL REFLECTIONS AND NILPOTENCY IN EXACT MAL’TSEV CATEGORIES CLEMENS BERGER AND DOMINIQUE BOURN Abstract. We study nilpotency in the context of exact Mal’tsev categories taking central extensions as the primitive notion. This yields a nilpotency tower which is analysed from ...	4
Compressed Anomaly Detection with Multiple Mixed Observations arXiv:1801.10264v1 [cs.IT] 31 Jan 2018 Natalie Durgin, Rachel Grotheer, Chenxi Huang, Shuang Li, Anna Ma, Deanna Needell and Jing Qin Abstract We consider a collection of independent random variables that are identically distributed, except for a small su...	7
MIT CSAIL Technical Report MIT-LCS-TR-997 On Algorithms and Complexity for Sets with Cardinality Constraints PSPACE and PTIME Logics for Program Analysis arXiv:cs/0508123v1 [cs.PL] 28 Aug 2005 Bruno Marnette ENS de Cachan, MPRI Paris, France bruno@marnette.fr Abstract Typestate systems ensure many desirable propert...	6
Reinforced stochastic gradient descent for deep neural network learning Haiping Huang∗ and Taro Toyoizumi† arXiv:1701.07974v5 [cs.LG] 22 Nov 2017 RIKEN Brain Science Institute, Wako-shi, Saitama 351-0198, Japan (Dated: November 23, 2017) Stochastic gradient descent (SGD) is a standard optimization method to minimize ...	9
arXiv:1801.00212v1 [math.PR] 31 Dec 2017 BENFORD’S LAW BEYOND INDEPENDENCE: TRACKING BENFORD BEHAVIOR IN COPULA MODELS REBECCA F. DURST AND STEVEN J. MILLER A BSTRACT. Benford’s law describes a common phenomenon among many naturally occurring data sets and distributions in which the leading digits of the data are dist...	10
Further study on the maximum number of bent components of vectorial functions arXiv:1801.06542v1 [cs.IT] 21 Jan 2018 Sihem Mesnager1 , Fengrong Zhang2 , Chunming Tang3 , Yong Zhou2 1. LAGA, Department of Mathematics, University of Paris VIII (and Paris XIII and CNRS), Saint–Denis cedex 02, France. E-mail: smesnager@u...	7
Near Capacity Signaling over Fading Channels using Coherent Turbo Coded OFDM and Massive MIMO arXiv:1711.10104v1 [cs.IT] 28 Nov 2017 K. Vasudevan Dept. of EE IIT Kanpur India Email: vasu@iitk.ac.in Abstract—The minimum average signal-to-noise ratio (SNR) per bit required for error-free transmission over a fading chan...	7
On Inductive Abilities of Latent Factor Models for Relational Learning Théo Trouillon theo.trouillon@imag.fr Univ. Grenoble Alpes, 700 avenue Centrale, 38401 Saint Martin d’Hères, France arXiv:1709.05666v1 [cs.LG] 17 Sep 2017 Éric Gaussier eric.gaussier@imag.fr Univ. Grenoble Alpes, 700 avenue Centrale, 38401 Sain...	2
arXiv:1704.07548v1 [cs.AI] 25 Apr 2017 Semi-supervised Bayesian Deep Multi-modal Emotion Recognition Changde Du1 , Changying Du2 , Jinpeng Li1 , Wei-long Zheng3 , Bao-liang Lu 3 , Huiguang He1 1 Research Center for Brain-Inspired Intelligence, Institute of Automation, Chinese Academy of Sciences (CAS), Beijing, China ...	2
Unsupervised Grammar Induction with Depth-bounded PCFG arXiv:1802.08545v2 [cs.CL] 26 Feb 2018 Lifeng Jin Department of Linguistics The Ohio State University jin.544@osu.edu Timothy Miller Finale Doshi-Velez Boston Children’s Hospital & Harvard University Harvard Medical School finale@seas.harvard.edu timothy.miller@...	2
Symmetric Randomized Dependent Rounding ∗ David G. Harris† Thomas Pensyl‡ Aravind Srinivasan§ Khoa Trinh¶ arXiv:1709.06995v1 [cs.DS] 20 Sep 2017 Abstract Dependent rounding is a popular technique in designing approximation algorithms. It allows us to randomly round a fractional solution x to an integral vector X s...	8
On the Underapproximation of Reach Sets of Abstract Continuous-Time Systems Ievgen Ivanov Taras Shevchenko National University of Kyiv ivanov.eugen@gmail.com We consider the problem of proving that each point in a given set of states (“target set”) can indeed be reached by a given nondeterministic continuous-time dyna...	3
The final version of this paper has been published in “International Conference on Communication and Computing (ICC-2014)” http://www.elsevierst.com/conference_book_download_chapter.php?cbid=86#chapter41 A Fuzzy MLP Approach for Non-linear Pattern Classification Tirtharaj Dash, H.S. Behera Department of Computer Scien...	9
The average size of the kernel of a matrix and orbits of linear groups Tobias Rossmann arXiv:1704.02668v1 [math.NT] 9 Apr 2017 Department of Mathematics, University of Auckland, Auckland, New Zealand Let O be a compact discrete valuation ring of characteristic zero. Given a module M of matrices over O, we study the g...	4
Better Tradeoffs for Exact Distance Oracles in Planar Graphs∗ Paweł Gawrychowski, Shay Mozes, Oren Weimann, and Christian Wulff-Nilsen arXiv:1708.01386v1 [cs.DS] 4 Aug 2017 Abstract 1.5 We present an O(n )-space distance oracle for directed planar graphs that answers distance queries in O(log n) time. Our oracle bot...	8
A Liquid Cloud Storage arXiv:1705.07983v1 [cs.DC] 22 May 2017 Michael G. Luby, Qualcomm Technologies, Inc. (luby@qti.qualcomm.com) Roberto Padovani, Qualcomm Technologies, Inc. (padovani@qti.qualcomm.com) Thomas J. Richardson, Qualcomm Technologies, Inc. (tomr@qti.qualcomm.com) Lorenz Minder, Qualcomm Technologies, I...	3
Optimal Subhourly Electricity Resource Dispatch Under Multiple Price Signals With High Renewable Generation Availability David P. Chassin1,2 , Sahand Behboodi2 and Ned Djilali2 SLAC National Accelerator Laboratory, Menlo Park CA (USA) 2 Inst. for Integrated Energy Systems, and Mechanical Engineering Dept, University of...	3
THE USE OF BAD PRIMES IN RATIONAL RECONSTRUCTION arXiv:1207.1651v2 [math.AC] 7 Oct 2013 JANKO BÖHM, WOLFRAM DECKER, CLAUS FIEKER, AND GERHARD PFISTER Abstract. A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via ...	0
Information Bottleneck in Control Tasks with Recurrent Spiking Neural Networks Madhavun Candadai Vasu and Eduardo J. Izquierdo arXiv:1706.01831v1 [cs.NE] 6 Jun 2017 Cognitive Science, School of Informatics and Computing Indiana University, Bloomington, U.S.A. {madcanda,edizquie}@indiana.edu Abstract. The nervous sys...	7
Statistical Watermarking for Networked Control Systems arXiv:1709.08617v1 [math.OC] 25 Sep 2017 Pedro Hespanhol, Matthew Porter, Ram Vasudevan, and Anil Aswani Abstract— Watermarking can detect sensor attacks in control systems by injecting a private signal into the control, whereby attacks are identified by checkin...	3
&+(3/D-ROOD&DOLIRUQLD0DUFK 1 Design, implementation and deployment of the Saclay muon reconstruction algorithms (Muonbox/y) in the Athena software framework of the ATLAS experiment A. Formica DAPNIA/SEDI, CEA/Saclay, 91191 Gif-sur-Yvette CEDEX, France This paper gives an overview of a reconstruc...	5
Evolutionary Trees and the Ising Model on the Bethe Lattice: A Proof of Steel’s Conjecture∗ arXiv:math/0509575v3 [math.PR] 28 Jul 2009 Constantinos Daskalakis† Elchanan Mossel‡ Sébastien Roch§ April 16, 2018 Abstract A major task of evolutionary biology is the reconstruction of phylogenetic trees from molecular ...	5
QUICKEST DETECTION OF A MINIMUM OF TWO POISSON DISORDER TIMES arXiv:cs/0509029v4 [cs.CE] 25 Apr 2007 ERHAN BAYRAKTAR ∗ AND H. VINCENT POOR† Abstract. A multi-source quickest detection problem is considered. Assume there are two independent Poisson processes X 1 and X 2 with disorder times θ1 and θ2 , respectively;...	5
arXiv:1606.08036v2 [math.GR] 29 Dec 2017 THE BOUNDED AND PRECISE WORD PROBLEMS FOR PRESENTATIONS OF GROUPS S. V. IVANOV Abstract. We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group,...	4
arXiv:1608.04132v3 [cs.DS] 14 Mar 2017 Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks Massimo Cairo Carlo Comin Romeo Rizzi Department of Mathematics University of Trento, Trento, Italy (massimo.cairo@unitn.it) Department of Mathematics University of Trento, Tre...	8
Coalescent-based species tree estimation: a stochastic Farris transform ∗ arXiv:1707.04300v1 [cs.LG] 13 Jul 2017 Gautam Dasarathy† Elchanan Mossel‡ Sebastien Roch¶ Robert Nowak§ Abstract The reconstruction of a species phylogeny from genomic data faces two significant hurdles: 1) the trees describing the evolution...	10
1 Spectral Efficiency Optimization For Millimeter Wave Multi-User MIMO Systems arXiv:1801.07560v1 [cs.IT] 23 Jan 2018 Qingjiang Shi and Mingyi Hong Abstract—As a key enabling technology for 5G wireless, millimeter wave (mmWave) communication motivates the utilization of large-scale antenna arrays for achieving high...	7
Distributed Semi-Stochastic Optimization with Quantization Refinement arXiv:1603.06306v1 [math.OC] 21 Mar 2016 Neil McGlohon and Stacy Patterson Abstract— We consider the problem of regularized regression in a network of communication-constrained devices. Each node has local data and objectives, and the goal is for ...	3
1 Evaluating the Performance of eMTC and NB-IoT for Smart City Applications Mohieddine El Soussi, Pouria Zand, Frank Pasveer and Guido Dolmans Holst Centre/imec, Eindhoven, The Netherlands arXiv:1711.07268v1 [cs.IT] 20 Nov 2017 e-mail:{mohieddine.elsoussi, pouria.zand, frank.pasveer and guido.dolmans}@imec-nl.nl Ab...	7
A Basic Recurrent Neural Network Model Fathi M. Salem arXiv:1612.09022v1 [cs.NE] 29 Dec 2016 Circuits, Systems, and Neural Networks (CSANN) Lab Department of Electrical and Computer Engineering Michigan State University East Lansing, Micigan 48824–1226 Email:salemf@msu.edu Abstract—We present a model of a basic recu...	9
arXiv:1606.00539v2 [math.GR] 5 Jan 2017 Geometric embedding properties of Bestvina-Brady subgroups HUNG CONG TRAN We compute the relative divergence of right-angled Artin groups with respect to their Bestvina-Brady subgroups and the subgroup distortion of Bestvina-Brady subgroups. We also show that for each integer n...	4
Dynamic Weight Alignment for Convolutional Neural Networks Brian Kenji Iwana and Seiichi Uchida Department of Advanced Information Technology Kyushu University, Fukuoka, Japan Abstract Input In this paper, we propose a method of improving Convolutional Neural Networks (CNN) by determining the optimal alignment of we...	9
Submitted to the Annals of Statistics arXiv: arXiv:1701.06088 DISTRIBUTED INFERENCE FOR QUANTILE REGRESSION PROCESSES arXiv:1701.06088v3 [math.ST] 10 Apr 2018 By Stanislav Volgushev¶,§ , Shih-Kang Chaok,† and Guang Chengk,‡,† University of Toronto¶ and Purdue Universityk The increased availability of massive data se...	10
APPROXIMATE SUBLOOPS AND FREIMAN’S THEOREM IN FINITELY GENERATED COMMUTATIVE MOUFANG LOOPS arXiv:1802.10471v1 [math.GR] 28 Feb 2018 ARINDAM BISWAS Abstract. Fix a parameter K > 1. A K-approximate subgroup is a finite set A in a group G which contains the identity, is symmetric and such that A.A can covered by K left ...	4
arXiv:1304.0305v2 [math.AC] 3 Apr 2013 ON THE NUMBER OF GENERATORS OF IDEALS DEFINING GORENSTEIN ARTIN ALGEBRAS WITH HILBERT FUNCTION n+1 n+1 (1, n + 1, 1 + 2 , . . . , 2 + 1, n + 1, 1) SABINE EL KHOURY, A. V. JAYANTHAN, AND HEMA SRINIVASAN Abstract. Let R = k[w, x1 , . . . , xn ]/I be a graded Gorenstein Artin a...	0
Path Planning With Kinematic Constraints For Robot Groups arXiv:1704.07538v1 [cs.AI] 25 Apr 2017 Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Sven Koenig, Nora Ayanian Abstract— Path planning for multiple robots is well studied in the AI and robotics communities. For a given discretized environment, ro...	2
Temporal and Volumetric Denoising via Quantile Sparse Image (QuaSI) Prior in Optical Coherence Tomography and Beyond Franziska Schirrmacher1,∗ , Thomas Köhler1,4,∗ , Tobias Lindenberger1 , Lennart Husvogt1 , Jürgen Endres1,3 , James G. Fujimoto2 , Joachim Hornegger1 , Arnd Dörfler3 , Philip Hoelter3 , and Andreas K....	1
This paper was presented at the 2017 51st Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, 2017. Copyright (c) 2017 IEEE. milliProxy: a TCP Proxy Architecture for 5G mmWave Cellular Systems Michele Polese∗ , Marco Mezzavilla† , Menglei Zhang† , Jing Zhu , Sundeep Rangan† , Shivendra Panwar† ,...	7
arXiv:1709.06990v1 [cs.NE] 20 Sep 2017 Text Compression for Sentiment Analysis via Evolutionary Algorithms Emmanuel Dufourq Bruce A. Bassett University of Cape Town African Institute for Mathematical Sciences Email: edufourq@gmail.com University of Cape Town African Institute for Mathematical Sciences South African...	9
Resilient Distributed State Estimation for LTI Systems ⋆ Aritra Mitra and Shreyas Sundaram a arXiv:1802.09651v1 [cs.SY] 27 Feb 2018 a School of Electrical and Computer Engineering at Purdue University, West Lafayette, IN 47907, USA Abstract Consider a linear time-invariant (LTI) dynamical system monitored by a netw...	3
Nonparametric Inference for Auto-Encoding Variational Bayes arXiv:1712.06536v1 [stat.ML] 18 Dec 2017 Erik Bodin * Iman Malik * * Carl Henrik Ek * University of Bristol † Neill D. F. Campbell † University of Bath Variational approximations are an attractive approach for inference of latent variables in unsuperv...	2
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently Ilias Diakonikolas∗ CS, USC diakonik@usc.edu arXiv:1704.03866v2 [cs.DS] 5 Nov 2017 Jerry Li § EECS & CSAIL, MIT jerryzli@mit.edu Gautam Kamath† EECS & CSAIL, MIT g@csail.mit.edu Ankur Moitra¶ Math & CSAIL, MIT moitra@mit.edu Daniel M. Kane‡ CSE & Math...	10
ON THE ALGEBRAIC AND ARITHMETIC STRUCTURE OF THE MONOID OF PRODUCT-ONE SEQUENCES arXiv:1802.00991v1 [math.AC] 3 Feb 2018 JUN SEOK OH Abstract. Let G be a finite group. A finite unordered sequence S = g1 · . . . · gℓ of terms from G, where repetition is allowed, is a product-one sequence if its terms can be ordered su...	0
. TOP LOCAL COHOMOLOGY, MATLIS DUALITY AND TENSOR PRODUCTS MAJID EGHBALI A BSTRACT. Let a be an ideal of a local ring ( R, m) with d = dim R. For i > d the local cohomology module Hai ( R) vanishes. In the case that Had ( R) 6 = 0, at first we give a bound for depth D ( Had ( R)), arXiv:1302.1274v1 [math.AC] 6 Feb 20...	0
What Doubling Tricks Can and Can’t Do for Multi-Armed Bandits Lilian Besson† L ILIAN .B ESSON @C ENTRALE S UPELEC . FR CentraleSupélec (campus of Rennes), IETR, SCEE Team, Avenue de la Boulaie – CS 47601, F-35576 Cesson-Sévigné, France arXiv:1803.06971v1 [stat.ML] 19 Mar 2018 Emilie Kaufmann EMILIE . KAUFMANN @ ...	10
Algorithmic Linearly Constrained Gaussian Processes Markus Lange-Hegermann 1 arXiv:1801.09197v1 [stat.ML] 28 Jan 2018 Abstract We algorithmically construct multi-output Gaussian process priors which satisfy linear differential equations. Our approach attempts to parametrize all solutions of the equations using Gröb...	0
Decarbonized Demand Response for Residential Plug-in Electric Vehicles in Smart Grids Farshad Rassaei, Wee-Seng Soh and Kee-Chaing Chua arXiv:1604.00812v1 [math.OC] 4 Apr 2016 Department of Electrical and Computer Engineering National University of Singapore, Singapore Email: farshad@u.nus.edu, {weeseng,chuakc}@nus.e...	5
Recursive Sampling for the Nyström Method arXiv:1605.07583v5 [cs.LG] 3 Nov 2017 Cameron Musco MIT cnmusco@mit.edu Christopher Musco MIT cpmusco@mit.edu November 6, 2017 Abstract We give the first algorithm for kernel Nyström approximation that runs in linear time in the number of training points and is provably ...	8
arXiv:1710.05012v1 [cs.IT] 13 Oct 2017 Potential Conditional Mutual Information: Estimators and Properties Arman Rahimzamani and Sreeram Kannan∗ Department of Electrical Engineering, University of Washington, Seattle October 16, 2017 Abstract The conditional mutual information I(X; Y \|Z) measures the average informat...	7
TRACE RECONSTRUCTION WITH VARYING DELETION PROBABILITIES arXiv:1708.02216v1 [math.PR] 7 Aug 2017 LISA HARTUNG, NINA HOLDEN, AND YUVAL PERES A BSTRACT. In the trace reconstruction problem an unknown string x = (x0 , . . . , xn−1 ) ∈ {0, 1, ..., m − 1}n is observed through the deletion channel, which deletes each xk wi...	10
Self Organizing Maps to efficiently cluster and functionally interpret protein conformational ensembles Domenico Fraccalvieri* 1 Laura Bonati 1 Fabio Stella 2 1 Department 2 Department 1 of Earth and Environmental Sciences, University of Milano Bicocca, Milano, IT of Informatics, Systems and Communication, Univers...	5
Decoding-History-Based Adaptive Control of Attention for Neural Machine Translation arXiv:1802.01812v1 [cs.CL] 6 Feb 2018 Junyang Lin, Shuming Ma, Qi Su, Xu Sun MOE Key Laboratory of Computational Linguistics, Peking University School of Electronics Engineering and Computer Science, Peking University School of Foreig...	2
arXiv:1803.01231v1 [stat.ME] 3 Mar 2018 Bayesian Projected Calibration of Computer Models Fangzheng Xie and Yanxun Xu ∗ Department of Applied Mathematics and Statistics, Johns Hopkins University Abstract We develop a Bayesian approach called Bayesian projected calibration to address the problem of calibrating an impe...	10
HARISH-CHANDRA–SCHWARTZ’S ALGEBRAS ASSOCIATED WITH DISCRETE SUBGROUPS OF SEMISIMPLE LIE GROUPS arXiv:1607.07830v1 [math.GR] 26 Jul 2016 ADRIEN BOYER Abstract. We prove that the Harish-Chandra–Schwartz space associated with a discrete subgroup of a semisimple Lie group is a dense subalgebra of the reduced C ∗ algebra...	4
1 Maximizing the Link Throughput between Smart meters and Aggregators as Secondary arXiv:1506.04830v3 [cs.SY] 16 Feb 2016 Users under Power and Outage Constraints Pedro H. J. Nardelli, Mauricio de Castro Tomé, Hirley Alves, Carlos H. M. de Lima and Matti Latva-aho Abstract This paper assesses the communication link ...	3
Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform Paulo A. M. Oliveira∗ Renato J. Cintra† Fábio M. Bayer‡ Sunera Kulasekera§ Arjuna Madanayake§ arXiv:1609.07630v2 [cs.MM] 20 Apr 2017 Abstract The usage of linear transformations has great relevance for data decorrelation ...	8
ON THE FINITENESS OF BASS NUMBERS OF LOCAL COHOMOLOGY MODULES AND COMINIMAXNESS KAMAL BAHMANPOUR, REZA NAGHIPOUR∗ AND MONIREH SEDGHI arXiv:1309.0431v1 [math.AC] 2 Sep 2013 DEDICATED TO PROFESSOR HYMAN BASS Abstract. In this paper, we continue the study of cominimaxness modules with respect to an ideal of a commutati...	0
NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH arXiv:1803.06989v1 [math.ST] 19 Mar 2018 GEORGE C. LINDERMAN AND STEFAN STEINERBERGER Abstract. Let G = (V, E, w) be a finite, connected graph with weighted edges. We are interested in the problem of finding a subset W ⊂ V of vertices and weights aw s...	10
. arXiv:1710.02505v1 [math.NT] 6 Oct 2017 RIGID LOCAL SYSTEMS AND ALTERNATING GROUPS ROBERT M. GURALNICK, NICHOLAS M. KATZ, AND PHAM HUU TIEP Contents 1. Introduction 2. The local systems in general 3. The candidate local systems for Alt(2q) 4. Basic facts about Hn 5. basic facts about H2q−1 6. Basic facts about the...	4

Subsets and Splits

No community queries yet

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