Split (3)

train · 27.2k rows

text stringlengths 2.85k 2.55M	label int64 0 10
ALMOST ENGEL COMPACT GROUPS arXiv:1610.02079v2 [math.GR] 12 May 2017 E. I. KHUKHRO AND P. SHUMYATSKY To Efim Zelmanov on occasion of his 60th birthday Abstract. We say that a group G is almost Engel if for every g ∈ G there is a finite set E (g) such that for every x ∈ G all sufficiently long commutators [...[[x, g],...	4
arXiv:1801.09117v1 [math.GR] 27 Jan 2018 Centralizer fusion systems of central involutions in a finite group with soluble centralizer of involutions KIVANÇ ERSOY and İPEK TUVAY Abstract. It is a long-standing open problem raised by Starostin to describe all finite groups with soluble centralizers of involutions. One...	4
1 Inexact Alternating Optimization for Phase Retrieval In the Presence of Outliers arXiv:1605.00973v2 [cs.IT] 24 Jul 2017 Cheng Qian, Xiao Fu, Member, IEEE, Nicholas D. Sidiropoulos, Fellow, IEEE, Lei Huang, Senior Member, IEEE, and Junhao Xie, Senior Member, IEEE Abstract—Phase retrieval has been mainly considered...	7
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints Sam Staton Hongseok Yang Frank Wood Chris Heunen Ohad Kammar University of Edinburgh University of Cambridge arXiv:1601.04943v3 [cs.PL] 4 May 2016 University of Oxford Abstract a distribution defined ...	6
To appear in IEEE/ACM Design Automation Conference 2017 Hardware-Software Codesign of Accurate, Multiplier-free Deep Neural Networks Hokchhay Tann, Soheil Hashemi, R. Iris Bahar, Sherief Reda School of Engineering, Brown University, Providence RI 02912 arXiv:1705.04288v1 [cs.NE] 11 May 2017 {hokchhay tann, soheil ha...	9
Primitivity, Uniform Minimality, and State Complexity of Boolean Operations arXiv:1702.00877v3 [cs.FL] 26 Mar 2018 Sylvie Davies University of Waterloo Department of Pure Mathematics sldavies@uwaterloo.ca Abstract. A minimal deterministic finite automaton (DFA) is uniformly minimal if it always remains minimal when ...	4
Taming Context-Sensitive Languages with Principled Stateful Parsing Nicolas Laurent Kim Mens arXiv:1609.05365v1 [cs.PL] 17 Sep 2016 Université catholique de Louvain, ICTEAM {nicolas.laurent, kim.mens}@uclouvain.be Abstract 1. Historically, true context-sensitive parsing has seldom been applied to programming lang...	6
Schur’s theory for partial projective representations arXiv:1711.06739v1 [math.GR] 17 Nov 2017 Mikhailo Dokuchaev and Nicola Sambonet∗ November 21, 2017 Abstract This article focuses on those aspects about partial actions of groups which are related to Schur’s theory on projective representations. It provides an exh...	4
arXiv:1309.7919v2 [nlin.CD] 11 Mar 2014 CRITICAL TRANSITIONS IN A MODEL OF A GENETIC REGULATORY SYSTEM Jesse Berwald Institute for Mathematics and Its Applications Minneapolis, Minneapolis, MN 55455, USA Marian Gidea Yeshiva University, Department of Mathematical Sciences, New York, NY 10016 and School of Mathematic...	5
Semi-Automatic Construction of a Domain Ontology for Wind Energy Using Wikipedia Articles Dilek Küçüka,∗, Yusuf Arslanb arXiv:1410.8581v1 [cs.CL] 30 Oct 2014 b a Power Electronics Department, TÜBİTAK Energy Institute, 06531, Ankara, Turkey Department of Computer Engineering, Middle East Technical University, 06...	5
Publications of the Astronomical Society of Australia (PASA) c Astronomical Society of Australia 2015; published by Cambridge University Press. doi: 10.1017/pas.2015.xxx. arXiv:1501.05992v1 [astro-ph.IM] 24 Jan 2015 The Murchison Widefield Array Correlator S. M. Ord4,20 , B. Crosse4 , D. Emrich4 , D. Pallot4 , R. B....	5
GENERALIZED IRREDUCIBLE DIVISOR GRAPHS CHRISTOPHER PARK MOONEY arXiv:1312.7406v1 [math.AC] 28 Dec 2013 Abstract. In 1988, I. Beck introduced the notion of a zero-divisor graph of a commutative rings with 1. There have been several generalizations in recent years. In particular, in 2007 J. Coykendall and J. Maney deve...	0
Lecture Notes on the ARV Algorithm for Sparsest Cut Thomas Rothvoss∗ University of Washington, Seattle arXiv:1607.00854v1 [cs.DS] 4 Jul 2016 July 5, 2016 Abstract p One of the landmarks in approximation algorithms is the O( log n)-approximation algorithm for the Uniform Sparsest Cut problem by Arora, Rao and Vaziran...	8
arXiv:1707.07184v2 [cs.CV] 24 Nov 2017 A survey of exemplar-based texture synthesis Lara Raad∗1 , Axel Davy†2 , Agnès Desolneux‡2 , and Jean-Michel Morel§2 1 Dept. of Information & Communications Technologies, Universitat Pompeu Fabra 2 CMLA, École normale supérieure Paris-Saclay November 28, 2017 Abstract Exemp...	1
TIME-DEPENDENT WAVE EQUATIONS ON GRADED GROUPS arXiv:1705.03047v2 [math.AP] 31 Jul 2017 MICHAEL RUZHANSKY AND CHIARA TARANTO Abstract. In this paper we consider the wave equations for hypoelliptic homogeneous left-invariant operators on graded Lie groups with time-dependent Hölder (or more regular) non-negative prop...	4
1 Green Data Centers: A Survey, Perspectives, and Future Directions Xibo Jin1,2 , Fa Zhang1 , Athanasios V. Vasilakos3 and Zhiyong Liu1 of Computing Technology, Chinese Academy of Sciences 2 University of Chinese Academy of Sciences, Beijing, China 3 University of Western Macedonia, Greece 1,2 Email: {jinxibo, zhangfa...	8
CELLULAR RESOLUTIONS FROM MAPPING CONES arXiv:1311.4599v1 [math.AC] 19 Nov 2013 ANTON DOCHTERMANN AND FATEMEH MOHAMMADI Abstract. One can iteratively obtain a free resolution of any monomial ideal I by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takaya...	0
MapReduce Algorithms for Inferring Gene Regulatory Networks from Time‐Series Microarray Data Using an Information‐Theoretic Approach Yasser Abduallah, Turki Turki, Kevin Byron, Zongxuan Du, Miguel Cervantes-Cervantes Jason T. L. Wang Computer Science Department, New Jersey Institute of Technology, Newark, NJ 07102, US...	5
arXiv:1706.08329v3 [cs.LO] 18 Dec 2017 Faculty of Computer Science Institute of Artificial Intelligence Knowledge Representation and Reasoning The Boolean Solution Problem from the Perspective of Predicate Logic – Extended Version – Christoph Wernhard KRR Report 17-01 Mail to Technische Universität Dresden 0106...	2
arXiv:1709.03028v2 [cs.CV] 23 Oct 2017 Convolutional Neural Networks: Ensemble Modeling, Fine-Tuning and Unsupervised Semantic Localization for Intraoperative CLE Images Mohammadhassan Izadyyazdanabadia,b,∗, Evgenii Belykha,b,c , Michael Mooneyb , Nikolay Martirosyanb , Jennifer Eschbacherb , Peter Nakajib , Mark C. P...	1
Deep Tracking on the Move: Learning to Track the World from a Moving Vehicle using Recurrent Neural Networks Ground Truth Comparison Occupancy Prediction Neural Network Abstract— This paper presents an end-to-end approach for tracking static and dynamic objects for an autonomous vehicle driving through crowded urban...	2
Maximal subgroups of SL(n, Z) arXiv:1511.05767v2 [math.GR] 17 Apr 2016 Tsachik Gelander and Chen Meiri April 19, 2016 Dedicated to the 75’th birthday of Herbert Abels 1 Introduction More than three decades ago, in a remarkable paper [MS81], Margulis and Soifer proved existence of maximal subgroups of infinite inde...	4
arXiv:1603.04000v1 [cs.CV] 13 Mar 2016 1 Learning Typographic Style Shumeet Baluja shumeet@google.com Google, Inc. Abstract. Typography is a ubiquitous art form that affects our understanding, perception, and trust in what we read. Thousands of different font-faces have been created with enormous variations in the c...	9
REGULAR SEQUENCES AND LOCAL COHOMOLOGY MODULES WITH RESPECT TO A PAIR OF IDEALS arXiv:1305.0429v1 [math.AC] 2 May 2013 SH. PAYROVI AND M. LOTFI PARSA A BSTRACT. Let R be a Noetherian ring, I and J two ideals of R and t an integer. Let S be the class of Artinian R-modules, or the class of all R-modules N i (M) ∈ with ...	0
arXiv:1703.03701v2 [math.GR] 20 Mar 2017 Profinite detection of 3-manifold decompositions Henry Wilton∗ and Pavel Zalesskii† March 21, 2017 Abstract The profinite completion of the fundamental group of a closed, orientable 3-manifold determines the Kneser–Milnor decomposition. If M is irreducible, then the profinite ...	4
Generating Contradictory, Neutral, and Entailing Sentences Yikang Shen * 1 Shawn Tan * 1 Chin-Wei Huang * 1 Aaron Courville 1 arXiv:1803.02710v1 [cs.CL] 7 Mar 2018 Abstract Learning distributed sentence representations remains an interesting problem in the field of Natural Language Processing (NLP). We want to learn...	2
1 Information-Theoretic Privacy for Smart Metering Systems with a Rechargeable Battery arXiv:1510.07170v4 [cs.IT] 15 Sep 2017 Simon Li, Ashish Khisti, and Aditya Mahajan Abstract—Smart-metering systems report electricity usage of a user to the utility provider on almost real-time basis. This could leak private info...	7
On the Evaluation of Plug-in Electric Vehicle Data of a Campus Charging Network arXiv:1602.02943v1 [math.OC] 9 Feb 2016 Islam Safak Bayram Qatar Environment and Energy Research Institute and College of Science and Engineering Hamad Bin Khalifa University Doha, Qatar ibayram@qf.org.qa Abstract—The mass adoption of pl...	3
Closed loop interactions between spiking neural network and robotic arXiv:1604.04764v1 [cs.NE] 16 Apr 2016 simulators based on MUSIC and ROS Philipp Weidel1∗ , Mikael Djurfeldt2,1 , Renato Duarte1,3,4 , Abigail Morrison1,4,5,6 1 Institute for Advanced Simulation (IAS-6), Theoretical Neuroscience & Institute of Neur...	9
1 Sensor Fault Detection, Isolation and Identification Using Multiple Model-based Hybrid Kalman Filter for Gas Turbine Engines* arXiv:1505.02063v2 [cs.SY] 27 Aug 2015 Bahareh Pourbabaee1 , Nader Meskin2 and Khashayar Khorasani1 Abstract In this paper, a novel sensor fault detection, isolation and identification (FD...	3
ALMOST MAXIMAL GROWTH OF THE HILBERT FUNCTION arXiv:1403.1409v1 [math.AG] 6 Mar 2014 LUCA CHIANTINI AND JUAN MIGLIORE∗ A BSTRACT. Let A = S/J be a standard artinian graded algebra over the polynomial ring S. A theorem of Macaulay dictates the possible growth of the Hilbert function of A from any degree to the next, a...	0
Exploration of Pattern-Matching Techniques for Lossy Compression on Cosmology Simulation Data Sets Dingwen Tao1 , Sheng Di2 , Zizhong Chen1 , and Franck Cappello2,3 arXiv:1707.08205v2 [cs.IT] 6 Aug 2017 1 3 University of California, Riverside, CA, USA {dtao001, chen}@cs.ucr.edu 2 Argonne National Laboratory, IL, US...	7
arXiv:1802.07795v1 [quant-ph] 21 Feb 2018 Communication Complexity of One-Shot Remote State Preparation ∗ Shima Bab Hadiashar U. Waterloo † Ashwin Nayak U. Waterloo ‡ Renato Renner ETH Zurich § Abstract Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum st...	7
arXiv:1712.05291v1 [cs.GT] 14 Dec 2017 A Bayesian Clearing Mechanism for Combinatorial Auctions Gianluca Brero University of Zurich Sébastien Lahaie Google Research brero@ifi.uzh.ch slahaie@google.com Abstract We cast the problem of combinatorial auction design in a Bayesian framework in order to incorporate prior...	2
arXiv:1512.02170v2 [math.RT] 11 Jan 2016 The Littlewood-Richardson rule for wreath products with symmetric groups and the quiver of the category F ≀ FIn Itamar Stein∗ Department of Mathematics Bar Ilan University 52900 Ramat Gan Israel Abstract We give a new proof for the Littlewood-Richardson rule for the wreath pro...	4
HOMOGENEOUS LOCALLY NILPOTENT DERIVATIONS OF NON-FACTORIAL TRINOMIAL ALGEBRAS arXiv:1710.10610v1 [math.AG] 29 Oct 2017 YULIA ZAITSEVA Abstract. We describe homogeneous locally nilpotent derivations of the algebra of regular functions for a class of affine trinomial hypersurfaces. This class comprises all nonfactorial...	0
IEEE TRANSACTIONS ON COMMUNICATIONS 2018 1 arXiv:1802.08676v1 [quant-ph] 23 Feb 2018 A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal Routing in Wireless Multihop Networks Dimitrios Alanis, Student Member, IEEE, Panagiotis Botsinis, Member, IEEE, Zunaira Babar, Hung Viet Nguyen, Member, IEEE, ...	8
1 arXiv:1708.03183v1 [cs.CE] 10 Aug 2017 Automated Tiling of Unstructured Mesh Computations with Application to Seismological Modelling FABIO LUPORINI, Imperial College London MICHAEL LANGE, Imperial College London CHRISTIAN T. JACOBS, University of Southampton GERARD J. GORMAN, Imperial College London J. RAMANUJAM, ...	5
A Decentralized Mechanism for Computing Competitive Equilibria in Deregulated Electricity Markets∗ arXiv:1603.03083v2 [math.OC] 23 Mar 2016 Erik Miehling and Demosthenis Teneketzis† Abstract— With the increased level of distributed generation and demand response comes the need for associated mechanisms that can perfo...	3
In-Datacenter Performance Analysis of a Tensor Processing UnitTM Norman P. Jouppi, Cliff Young, Nishant Patil, David Patterson, Gaurav Agrawal, Raminder Bajwa, Sarah Bates, Suresh Bhatia, Nan Boden, Al Borchers, Rick Boyle, Pierre-luc Cantin, Clifford Chao, Chris Clark, Jeremy Coriell, Mike Daley, Matt Dau, Jeffrey De...	9
Linear Regression with Sparsely Permuted Data arXiv:1710.06030v2 [math.ST] 15 Nov 2017 Martin Slawski Department of Statistics George Mason University Fairfax, VA 22030, USA mslawsk3@gmu.edu Emanuel Ben-David Center for Statistical Research Methodology U.S. Census Bureau Suitland, MD 20746, USA emanuel.ben.david@cen...	10
Complexity Analysis of Unsaturated Flow in Heterogeneous Media Using a Complex Network Approach Hamed.O.Ghaffari, Mamdou Fall and Erman.Evgin Dept. Civil Engineering, University of Ottawa, Ottawa, Ontario, Canada Abstract: In this study, we investigate the complexity of two-phase flow (air/water) in a heterogeneous so...	5
arXiv:1707.06883v3 [math.AG] 23 Mar 2018 IS THE AFFINE SPACE DETERMINED BY ITS AUTOMORPHISM GROUP? HANSPETER KRAFT, ANDRIY REGETA, AND IMMANUEL VAN SANTEN (BORN STAMPFLI) Abstract. In this note we study the problem of characterizing the complex aﬃne space An via its automorphism group. We prove the following. Let X be...	4
1 Phase Retrieval Without Small-Ball Probability Assumptions arXiv:1604.07281v3 [cs.IT] 11 Sep 2017 Felix Krahmer Abstract—In the context of the phase retrieval problem, it is known that certain natural classes of measurements, such as Fourier measurements and random Bernoulli measurements, do not lead to the uniqu...	7
ScreenerNet: Learning Self-Paced Curriculum for Deep Neural Networks Tae-Hoon Kim 1 Jonghyun Choi 2 arXiv:1801.00904v2 [cs.CV] 20 Feb 2018 Abstract We propose to learn a curriculum or a syllabus for supervised learning and deep reinforcement learning with deep neural networks by an attachable deep neural network, ca...	1
Polyphonic Music Generation by Modeling Temporal Dependencies Using a RNN-DBN arXiv:1412.7927v1 [cs.LG] 26 Dec 2014 Kratarth Goel, Raunaq Vohra, and J. K. Sahoo Birla Institute of Technology and Science, Pilani, Goa, India kratarthgoel@gmail.com, ronvohra@gmail.com, jksahoo@goa.bits-pilani.ac.in Abstract. In this pa...	9
arXiv:1603.00585v1 [cs.NI] 2 Mar 2016 Optimal Scheduling for Incentive WiFi Offloading under Energy Constraint Juntao Gao, Minoru Ito Norio Shiratori Graduate School of Information Science Nara Institute of Science and Technology, Nara, Japan Email: {jtgao, ito}@is.naist.jp Research Institute of Electrical Communic...	8
Multiplying a Gaussian Matrix by a Gaussian Vector arXiv:1702.02815v2 [math.PR] 5 Apr 2017 Pierre-Alexandre Mattei pierre-alexandre.mattei@parisdescartes.fr Laboratoire MAP5, UMR CNRS 8145 Université Paris Descartes & Sorbonne Paris Cité 45 rue des Saints-Pères, 75006 Paris, France Abstract We provide a new and si...	10
On Quantitatively Measuring Controllability of Complex Networks CAI, Ning1, 2 1 College of Electrical Engineering, Northwest University for Nationalities, Lanzhou, China 2 School of Automation, Hangzhou Dianzi University, Hangzhou, China E-mail: caining91@tsinghua.org.cn Abstract: This letter deals with the controll...	3
1 Progressive Joint Modeling in Unsupervised Single-channel Overlapped Speech Recognition arXiv:1707.07048v2 [cs.CL] 20 Oct 2017 Zhehuai Chen, Student Member, IEEE,, Jasha Droppo, Senior Member, IEEE,, Jinyu Li, Member, IEEE,, Wayne Xiong, Member, IEEE,, Abstract—Unsupervised single-channel overlapped speech recogn...	2
arXiv:0912.4360v1 [cs.PL] 22 Dec 2009 Under consideration for publication in Theory and Practice of Logic Programming 1 Polytool: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs MANH THANG NGUYEN Deceased on June 3, 2009 DANNY DE SCHREYE Department of Computer Science, K. U. Leuven ...	6
1 Patch-Based Low-Rank Minimization for Image Denoising arXiv:1506.08353v2 [cs.CV] 21 Feb 2018 Haijuan Hu, Jacques Froment, Quansheng Liu Abstract—Patch-based sparse representation and low-rank approximation for image processing attract much attention in recent years. The minimization of the matrix rank coupled wit...	1
Mean Field Multi-Agent Reinforcement Learning Yaodong Yang * 1 Rui Luo * 1 Minne Li 1 Ming Zhou 2 Weinan Zhang 2 Jun Wang 1 arXiv:1802.05438v1 [cs.MA] 15 Feb 2018 Abstract Existing multi-agent reinforcement learning methods are limited typically to a small number of agents. When the agent number increases largely, th...	2
Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs (Extended Technical Report) arXiv:1102.2330v1 [cs.PL] 11 Feb 2011 Alastair Donaldson, Alexander Kaiser, Daniel Kroening, and Thomas Wahl Oxford University Computing Laboratory, United Kingdom Abstract. Predicate abstraction is a key enablin...	6
1 Bearing Rigidity Theory and its Applications for Control and Estimation of Network Systems Life Beyond Distance Rigidity arXiv:1803.05505v1 [cs.SY] 14 Mar 2018 Shiyu Zhao Distributed control and estimation of multi-agent systems has received tremendous research attention in recent years due to their potential acr...	3
Just-in-Time Static Type Checking for Dynamic Languages Brianna M. Ren Jeffrey S. Foster arXiv:1604.03641v1 [cs.PL] 13 Apr 2016 University of Maryland, College Park {bren, jfoster}@cs.umd.edu Abstract and convoluted; and prior mixed static/dynamic systems are either cumbersome or make certain limiting assumptions....	6
arXiv:1602.02862v1 [cs.NE] 9 Feb 2016 A Feature-Based Prediction Model of Algorithm Selection for Constrained Continuous Optimisation Frank Neumann Optimisation and Logistics School of Computer Science The University of Adelaide Adelaide, Australia Shayan Poursoltan Optimisation and Logistics School of Computer Scien...	9
Information-geometrical characterization of statistical models which are statistically equivalent to probability simplexes arXiv:1701.07736v2 [cs.IT] 8 Feb 2017 Hiroshi Nagaoka Graduate School of Informatics and Engineering The University of Electro-Communications Chofu, Tokyo 182-8585, Japan Email: nagaoka@is.uec.ac...	10
Scalable photonic reinforcement learning by time-division multiplexing of laser chaos Makoto Naruse1*, Takatomo Mihana2, Hirokazu Hori3, Hayato Saigo4, Kazuya Okamura5, Mikio Hasegawa6 and Atsushi Uchida2 1 Network System Research Institute, National Institute of Information and Communications Technology, 4-2-1 Nukui...	2
УДК 004.9:66.013.512 ИНФОРМАТИКА МОДУЛЬНАЯ ТЕХНОЛОГИЯ РАЗРАБОТКИ РАСШИРЕНИЙ САПР: МОЛНИЕЗАЩИТА ЗДАНИЙ И СООРУЖЕНИЙ В.В.Мигунов, Р.Р.Кафиятуллов, И.Т.Сафин ЦЭСИ РТ при КМ РТ, г. Казань Аннотация Модульная технология разработки проблемно-ориентированных расширений САПР применена к задаче проектирования молниезащиты зд...	5
Compact Environment-Invariant Codes for Robust Visual Place Recognition arXiv:1709.08103v1 [cs.CV] 23 Sep 2017 Unnat Jain Dept. of Computer Science University of Illinois Urbana-Champaign Urbana, USA uj2@illinois.edu Vinay P. Namboodiri Dept. of Computer Science & Engg. Indian Institute of Technology Kanpur, India v...	1
arXiv:1706.01294v1 [math.CO] 5 Jun 2017 THE SMITH GROUP AND THE CRITICAL GROUP OF THE GRASSMANN GRAPH OF LINES IN FINITE PROJECTIVE SPACE AND OF ITS COMPLEMENT JOSHUA E. DUCEY AND PETER SIN Abstract. We compute the elementary divisors of the adjacency and Laplacian matrices of the Grassmann graph on 2-dimensional subs...	4
DuctTeip: An efficient programming model for distributed task based parallel computingI Afshin Zafaria , Elisabeth Larssona,∗, Martin Tilleniusa arXiv:1801.03578v1 [cs.DC] 10 Jan 2018 a Uppsala University, Department of Information Technology, Box 337, SE-751 05 Uppsala, Sweden Abstract Current high-performance com...	5
EVALUATING A SUBLINEAR-TIME ALGORITHM FOR THE MINIMUM SPANNING TREE WEIGHT PROBLEM arXiv:1701.08128v1 [cs.DS] 27 Jan 2017 GABRIELE SANTI∗ AND LEONARDO DE LAURENTIIS† Abstract. We present an implementation and an experimental evaluation of an algorithm that, given a connected graph G (represented by adjacency lists), ...	8
Quantum Information Processing manuscript No. (will be inserted by the editor) Two Gilbert-Varshamov Type Existential Bounds for Asymmetric Quantum Error-Correcting Codes arXiv:1705.04087v2 [quant-ph] 19 Oct 2017 Ryutaroh Matsumoto 19 October 2017 Abstract In this note we report two versions of Gilbert-Varshamov t...	7
IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS, DECEMBER 2017 1 Automatic Classification of Functional Gait Disorders arXiv:1712.06405v2 [cs.CV] 24 Dec 2017 Djordje Slijepcevic, Matthias Zeppelzauer, Anna-Maria Gorgas, Caterine Schwab, Michael Schüller, Arnold Baca, Christian Breiteneder, Brian Horsak Abstract...	1
arXiv:1510.08565v3 [cs.NE] 5 Nov 2015 Attention with Intention for a Neural Network Conversation Model Geoffrey Zweig Kaisheng Yao ∗ Microsoft Research Microsoft Research gzweig@microsoft.com kaisheny@microsoft.com Baolin Peng Chinese University of Hong Kong blpeng@se.cuhk.edu.hk Abstract In a conversation or a dialo...	9
Bayes estimator for multinomial parameters and Bhattacharyya distances Christopher Ferrie Centre for Engineered Quantum Systems, School of Physics, The University of Sydney, Sydney, NSW, Australia Robin Blume-Kohout arXiv:1612.07946v1 [math.ST] 23 Dec 2016 Sandia National Laboratories, Albuquerque, New Mexico, 87185...	10
ON THE PRIME GRAPH QUESTION FOR INTEGRAL GROUP RINGS OF CONWAY SIMPLE GROUPS arXiv:1711.11322v1 [math.RA] 30 Nov 2017 LEO MARGOLIS Abstract. The Prime Graph Question for integral group rings asks if it is true that if the normalized unit group of the integral group ring of a finite group G contains an element of orde...	4
arXiv:1212.4590v1 [math.AP] 19 Dec 2012 RELATIVE PARAMETRIZATION OF LINEAR MULTIDIMENSIONAL SYSTEMS J.F. Pommaret CERMICS, Ecole Nationale des Ponts et Chaussées, 6/8 Av. Blaise Pascal, 77455 Marne-la-Vallée Cedex 02, France E-mail: jean-francois.pommaret@wanadoo.fr, pommaret@cermics.enpc.fr URL: http://cermics.enpc...	0
Similarity-Aware Spectral Sparsification by Edge Filtering Zhuo Feng arXiv:1711.05135v2 [cs.DS] 15 Nov 2017 Department of Electrical and Computer Engineering Michigan Technological University Email: zhuofeng@mtu.edu Abstract—In recent years, spectral graph sparsification techniques that can compute ultra-sparse grap...	8
arXiv:1710.00402v2 [math.AC] 13 Oct 2017 Ext and local cohomology modules of face rings of simplicial posets Connor Sawaske Department of Mathematics University of Washington Seattle, WA 98195-4350, USA sawaske@math.washington.edu October 17, 2017 Abstract There are a large number of theorems detailing the homologica...	0
Polymorphic Types in ACL2 Benjamin Selfridge Eric Smith University of Texas at Austin Austin, TX benself@cs.utexas.edu Kestrel Institute Palo Alto, CA eric.smith@kestrel.edu This paper describes a tool suite for the ACL2 programming language which incorporates certain ideas from the Hindley-Milner paradigm of funct...	6
Targeted Random Projection for Prediction arXiv:1712.02445v1 [math.ST] 6 Dec 2017 from High-Dimensional Features Minerva Mukhopadhyay David B. Dunson Abstract We consider the problem of computationally-efficient prediction from high dimensional and highly correlated predictors in challenging settings where accurate...	10
On the Approximation of Constrained Linear Quadratic Regulator Problems and their Application to Model Predictive Control - Supplementary Notes Michael Muehlebach and Raffaello D’Andrea∗ arXiv:1803.05510v1 [cs.SY] 23 Feb 2018 Abstract By parametrizing input and state trajectories with basis functions different approx...	3
Computing local zeta functions of groups, algebras, and modules Tobias Rossmann arXiv:1602.00919v1 [math.GR] 2 Feb 2016 Fakultät für Mathematik, Universität Bielefeld, D-33501 Bielefeld, Germany We develop a practical method for computing local zeta functions of groups, algebras, and modules in fortunate cases. Using...	4
ZU064-05-FPR paper-jfp 6 February 2018 3:38 Under consideration for publication in J. Functional Programming 1 arXiv:1406.5106v1 [cs.PL] 19 Jun 2014 Pushdown flow analysis with abstract garbage collection J. IAN JOHNSON Northeastern University ILYA SERGEY IMDEA Software Institute CHRISTOPHER EARL University of U...	6
Hybrid Beamforming with Spatial Modulation in Multi-user Massive MIMO mmWave Networks Merve Yüzgeçcioglu and Eduard Jorswieck arXiv:1709.04826v1 [cs.IT] 14 Sep 2017 Communications Theory, Communications Laboratory Dresden University of Technology, D-01062 Dresden, Germany Email: {merve.yuzgeccioglu, eduard.jorswiec...	7
arXiv:1710.10069v1 [math.GR] 27 Oct 2017 THE MULTIPLICITIES OF ROOT NUMBER FUNCTIONS STEFAN-CHRISTOPH VIRCHOW Abstract. We consider the qth root number function for the symmetric group. Our aim is to develop an asymptotic formula for the multiplicities of the qth root number function as q tends to ∞. We use character ...	4
Efficient, Safe, and Probably Approximately Complete Learning of Action Models arXiv:1705.08961v1 [cs.AI] 24 May 2017 Roni Stern Ben Gurion University of the Negev Be’er Sheva, Israel roni.stern@gmail.com Abstract In this paper we explore the theoretical boundaries of planning in a setting where no model of the agen...	2
arXiv:1709.07021v1 [math.GR] 20 Sep 2017 UNIQUELY LABELLED GEODESICS OF COXETER GROUPS ELISABETH FINK AND KIRILL ZAINOULLINE Abstract. Studying geodesics in Cayley graphs of groups has been a very active area of research over the last decades. We introduce the notion of a uniquely labelled geodesic, abbreviated with ...	4
arXiv:1705.04200v1 [math.GR] 11 May 2017 ON BENJAMINI–SCHRAMM LIMITS OF CONGRUENCE SUBGROUPS ARIE LEVIT Abstract. A sequence of orbifolds corresponding to pairwise non-conjugate congruence lattices in a higher rank semisimple group over zero characteristic local fields is Benjamini–Schramm convergent to the universal...	4
On the hardness of losing weight Andrei Krokhin1 and Dániel Marx2 arXiv:1711.03894v1 [cs.DS] 10 Nov 2017 1 2 Department of Computer Science, Durham University, Durham, DH1 3LE, UK andrei.krokhin@durham.ac.uk Department of Computer Science and Information Theory, Budapest University of Technology and Economics, H-1...	8
MAXDIM OF SOME SIMPLE GROUPS arXiv:1712.04553v1 [math.GR] 12 Dec 2017 LIU TIANYUE AND R. KEITH DENNIS 1. Introduction There are various generalizations of the concept of dimension for vector spaces in finite group theory. In this paper we are primarily concerned with three of them, namely m(G), M axDim(G) and i(G). ...	4
arXiv:1310.6012v2 [q-bio.PE] 24 Nov 2015 Evolution of swarming behavior is shaped by how predators attack R ANDAL S. O LSON1,4,* , D AVID B. K NOESTER2,4, , AND C HRISTOPH A DAMI2,3,4.* 1 Department of Computer Science & Engineering Department of Microbiology & Molecular Genetics 3 Department of Physics and Astro...	9
arXiv:1801.07230v1 [cs.CV] 22 Jan 2018 DiscrimNet: Semi-Supervised Action Recognition from Videos using Generative Adversarial Networks Unaiza Ahsan Georgia Institute of Technology Chen Sun Google Irfan Essa Georgia Institute of Technology uahsan3@gatech.edu chensun@google.com irfan@gatech.edu Abstract We propos...	1
Australia's long-term electricity demand forecasting using deep neural networks  Homayoun Hamedmoghadam2, Nima Joorabloo1 and Mahdi Jalili1#, 1 School of Engineering, RMIT University, Melbourne, Australia 2 Faculty of Engineering, Monash University, Melbourne, Australia * These two authors contributed equally to th...	9
A SPLINE-ASSISTED SEMIPARAMETRIC APPROACH TO NONPARAMETRIC MEASUREMENT ERROR MODELS arXiv:1804.00793v1 [math.ST] 3 Apr 2018 By Fei Jiang∗ and Yanyuan Ma† University of Hong Kong∗ and Penn State University† Nonparametric estimation of the probability density function of a random variable measured with error is conside...	10
Disentangled Variational Auto-Encoder for Semi-supervised Learning Yang Li∗1 , Quan Pan1 , Suhang Wang3 , Haiyun Peng2 , Tao Yang 1 , and Erik Cambria2 1 arXiv:1709.05047v1 [cs.LG] 15 Sep 2017 2 School of Automation, Northwestern Polytechnical University School of Computer Science and Engineering, Nanyang Technologi...	2
Applying the Z-transform for the stati analysis of oating-point numeri al lters arXiv:0706.0252v1 [cs.PL] 2 Jun 2007 David Monniaux April 3, 2018 1 Introdu tion The stati analysis of ontrol/ ommand programs, with a view to proving the absen e of runtime errors, has re ently pi ked up steam, with the in eption o...	6
1 Bio-Inspired Local Information-Based Control for Probabilistic Swarm Distribution Guidance arXiv:1711.06869v1 [cs.MA] 18 Nov 2017 Inmo Jang, Hyo-Sang Shin, and Antonios Tsourdos Abstract—This paper addresses a task allocation problem for a large-scale robotic swarm, namely swarm distribution guidance problem. Unl...	10
arXiv:1706.02410v1 [math.ST] 7 Jun 2017 A SHARP MULTIPLIER INEQUALITY WITH APPLICATIONS TO HEAVY-TAILED REGRESSION PROBLEMS QIYANG HAN AND JON A. WELLNER Abstract. We develop a sharp multiplier Pinequality used to study the size of the multiplier empirical process ( n i=1 ξi f (Xi ))f ∈F , where ξi ’s and F are multi...	10
IEEE SIGNAL PROCESSING LETTERS, ACCEPTED NOVEMBER 2016 1 Deep Convolutional Neural Networks and Data Augmentation for Environmental Sound Classification arXiv:1608.04363v2 [cs.SD] 28 Nov 2016 Justin Salamon and Juan Pablo Bello Abstract—The ability of deep convolutional neural networks (CNN) to learn discriminativ...	9
Parallelizing Stochastic Approximation Through Mini-Batching and Tail-Averaging Prateek Jain∗, Sham M. Kakade†, Rahul Kidambi‡, Praneeth Netrapalli§, Aaron Sidford¶ arXiv:1610.03774v2 [stat.ML] 27 Oct 2016 Abstract This work characterizes the benefits of averaging techniques widely used in conjunction with stochastic...	8
Uncountable locally free groups and their group rings arXiv:1601.00295v1 [math.GR] 3 Jan 2016 TSUNEKAZU NISHINAKA University of Hyogo 8-2-1 Gakuen Nishimachi Nishiku Kobe-City 651-2197 Japan Email: nishinaka@econ.u-hyogo.ac.jp Abstract. In this note, we show that an uncountable locally free group, and therefore ever...	4
A Unified Framework for Pricing Credit and Equity Derivatives arXiv:0712.3617v2 [cs.CE] 20 Sep 2008 Erhan Bayraktar ‡ ∗† Bo Yang Abstract We propose a model which can be jointly calibrated to the corporate bond term structure and equity option volatility surface of the same company. Our purpose is to obtain expli...	5
Time complexity of concurrent programs⋆ – a technique based on behavioural types – arXiv:1511.05104v1 [cs.PL] 16 Nov 2015 Elena Giachino1 , Einar Broch Johnsen2, Cosimo Laneve1, and Ka I Pun2 1 Dept. of Computer Science and Engineering, University of Bologna – INRIA FOCUS 2 Dept. of Informatics, University of Oslo ...	6
Coverage and Rate of Downlink Sequence Transmissions with Reliability Guarantees arXiv:1704.05296v2 [cs.IT] 24 Jun 2017 Jihong Park and Petar Popovski Abstract—Real-time distributed control is a promising application of 5G in which communication links should satisfy certain reliability guarantees. In this letter, we ...	7
CITATION: Kruse, J., Sosa, R. & Connor, A.M. (2016) Procedural urban environments for FPS games. Paper presented at Interactive Entertainment 2016, 2-5 February, Canberra, Australia. Procedural Urban Environments for FPS Games Jan Kruse Ricardo Sosa Andy M. Connor Auckland University of Technology Private Bag 92006...	9
Finding Root Causes of Floating Point Error Alex Sanchez-Stern Pavel Panchekha University of California San Diego alexss@eng.ucsd.edu University of Washington pavpan@cs.washington.edu Sorin Lerner Zachary Tatlock University of California San Diego lerner@cs.ucsd.edu University of Washington ztatlock@cs.washingto...	6

Subsets and Splits

No community queries yet

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