Split (3)

train · 1k rows

text stringlengths 7.27k 650k	label int64 0 10
Qualitative Modelling via Constraint Programming: Past, Present and Future Thomas W. Kelsey1 , Lars Kotthoff1 , Christoffer A. Jefferson1 , Stephen A. Linton1 , Ian Miguel1 , Peter Nightingale1 , and Ian P. Gent1 arXiv:1209.3916v1 [] 18 Sep 2012 School of Computer Science, University of St Andrews, KY16 9SX, UK Abst...	5
arXiv:1711.04052v1 [] 11 Nov 2017 BIG COHEN-MACAULAY MODULES, MORPHISMS OF PERFECT COMPLEXES, AND INTERSECTION THEOREMS IN LOCAL ALGEBRA LUCHEZAR L. AVRAMOV, SRIKANTH B. IYENGAR, AND AMNON NEEMAN Abstract. There is a well known link from the first topic in the title to the third one. In this paper we thread that link ...	0
arXiv:1307.7970v4 [] 3 Mar 2015 1 Short Term Memory Capacity in Networks via the Restricted Isometry Property Adam S. Charles, Han Lun Yap, Christopher J. Rozell School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA Abstract Cortical networks are hypothesized to rely on transien...	9
Checks and Balances: A Low-complexity High-gain Uplink Power Controller for CoMP arXiv:1610.08491v1 [] 26 Oct 2016 Fangzhou Chen†§ , Yin Sun†§ , Yiping Qin‡ , and C. Emre Koksal† † Dept. of ECE, The Ohio State University, Columbus, OH ‡ Huawei Technologies Co., Shanghai, China § Co-primary authors Abstract—Coordinat...	3
PERFECT SNAKE-IN-THE-BOX CODES FOR RANK MODULATION arXiv:1602.08073v3 [math.CO] 14 Oct 2016 ALEXANDER E. HOLROYD Abstract. For odd n, the alternating group on n elements is generated by the permutations that jump an element from any odd position to position 1. We prove Hamiltonicity of the associated directed Cayley ...	4
A polynomial identity via differential operators arXiv:1703.04167v1 [] 12 Mar 2017 Anurag K. Singh Dedicated to Professor Winfried Bruns, on the occasion of his 70th birthday Abstract We give a new proof of a polynomial identity involving the minors of a matrix, that originated in the study of integer torsion in a l...	0
Debiasing the Debiased Lasso with Bootstrap Sai Li∗ arXiv:1711.03613v1 [] 9 Nov 2017 Department of Statistics and Biostatistics, Rutgers University November 13, 2017 Abstract In this paper, we prove that under proper conditions, bootstrap can further debias the debiased Lasso estimator for statistical inference of l...	10
Deep Health Care Text Classification Vinayakumar R, Barathi Ganesh HB, Anand Kumar M, Soman KP Center for Computational Engineering and Networking (CEN), Amrita School of Engineering Coimbatore, Amrita Vishwa Vidyapeetham, Amrita University, India, vinayakumarr77@gmail.com,barathiganesh.hb@gmail.com, m anandkumar@cb.am...	2
Fixed-point Characterization of Compositionality Properties of Probabilistic Processes Combinators Daniel Gebler Department of Computer Science, VU University Amsterdam, De Boelelaan 1081a, NL-1081 HV Amsterdam, The Netherlands e.d.gebler@vu.nl Simone Tini Department of Scienza e Alta Tecnologia, University of Insubri...	6
Speculative Staging for Interpreter Optimization Stefan Brunthaler University of California, Irvine s.brunthaler@uci.edu arXiv:1310.2300v1 [] 8 Oct 2013 Abstract many problems, e.g., a lot of tricky details, hard to debug, and substantial implementation effort. An alternative route is to explore the area of purely i...	6
The quadratic regulator problem and the Riccati arXiv:1610.07127v1 [math.OC] 23 Oct 2016 equation for a process governed by a linear Volterra integrodifferential equations∗ L. Pandolfi† March 31, 2018 Abstract: In this paper we study the quadratic regulator problem for a process governed by a Volterra integral equat...	3
Ideal Theory in Rings arXiv:1401.2577v1 [math.RA] 11 Jan 2014 (Idealtheorie in Ringbereichen) Emmy Noether Translated by Daniel Berlyne January 14, 2014 Contents. §1. §2. §3. §4. §5. §6. §7. §8. §9. §10. §11. §12. Introduction. Ring, ideal, finiteness condition. Representation of an ideal as the least common multip...	0
CONJUGACY GROWTH OF COMMUTATORS arXiv:1802.09507v1 [] 26 Feb 2018 PETER S. PARK Abstract. For the free group Fr on r > 1 generators (respectively, the free product G1 ∗ G2 of two nontrivial finite groups G1 and G2 ), we obtain the asymptotic for the number of conjugacy classes of commutators in Fr (respectively, G1 ∗...	4
arXiv:1803.01239v1 [] 3 Mar 2018 Krull dimension and regularity of binomial edge ideals of block graphs Carla Mascia, Giancarlo Rinaldo University of Trento ∗ March 6, 2018 Abstract We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge ideals of block graphs by computing the two distinguishe...	0
1 An Order Optimal Policy for Exploiting Idle Spectrum in Cognitive Radio Networks Jan Oksanen, Student Member, IEEE and Visa Koivunen, Fellow, IEEE Abstract—In this paper a spectrum sensing policy employing recency-based exploration is proposed for cognitive radio networks. We formulate the problem of ﬁnding a spect...	7
Degenerations of the generic square matrix. Polar map and determinantal structure Rainelly Cunha1 Zaqueu Ramos2 Aron Simis3 arXiv:1610.07681v4 [] 18 Oct 2017 Contents 1 Preliminaries 1.1 Review of ideal invariants . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 Homaloidal polynomials . . . . . . . . . ....	0
Multi-modal Aggregation for Video Classification Chen Chen Alibaba Group iDST chenen.cc@alibaba-inc.com Xiaowei Zhao Alibaba Group iDST zhiquan.zxw@alibaba-inc.com Yang Liu Alibaba Group iDST panjun.ly@alibaba-inc.com ABSTRACT In this paper, we present a solution to Large-Scale Video Classification Challenge (LSVC20...	1
arXiv:1104.2835v3 [] 13 Oct 2013 Combinatorial properties and characterization of glued semigroups J. I. Garcı́a-Garcı́a∗ M.A. Moreno-Frı́as† A. Vigneron-Tenorio‡ Abstract This work focuses on the combinatorial properties of glued semigroups and provides its combinatorial characterization. Some classical results for ...	0
Reverse Curriculum Generation for Reinforcement Learning arXiv:1707.05300v2 [] 17 Oct 2017 Carlos Florensa UC Berkeley florensa@berkeley.edu David Held UC Berkeley davheld@berkeley.edu Markus Wulfmeier Oxford Robotics Institute markus@robots.ox.ac.uk Michael Zhang UC Berkeley mzhang8@berkeley.edu Pieter Abbeel Ope...	9
arXiv:1802.06292v2 [stat.ML] 6 Mar 2018 Nonparametric Estimation of Low Rank Matrix Valued Function Fan Zhou∗ School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160 e-mail: fzhou40@math.gatech.edu Abstract: Let A : [0, 1] → Hm (the space of Hermitian matrices) be a matrix valued function which is...	10
Clustering via Crowdsourcing arXiv:1604.01839v1 [] 7 Apr 2016 Arya Mazumdar∗ Barna Saha† College of Information & Computer Science University of Massachusetts Amherst Amherst, MA, 01002 Abstract In recent years, crowdsourcing, aka human aided computation has emerged as an eﬀective platform for solving problems that ...	8
Journal of Scheduling manuscript No. (will be inserted by the editor) A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack arXiv:1508.01657v2 [] 24 Mar 2016 René van Bevern · Rolf Niedermeier · Ondřej Suchý Submitted: August 7, 2...	8
High Five: Improving Gesture Recognition by Embracing Uncertainty arXiv:1710.09441v1 [] 25 Oct 2017 Diman Zad Tootaghaj† , Adrian Sampson‡ , Todd Mytkowicz∗ , Kathryn S McKinley∗∗ † The Pennsylvania State University, ‡ Cornell University, ∗ Microsoft Research, ∗∗ Google Research {dxz149}@cse.psu.edu, {asampson}@cs.co...	1
An Anthropic Argument against the Future Existence of Superintelligent Artificial Intelligence Toby Pereira 8th May 2017 Abstract This paper uses anthropic reasoning to argue for a reduced likelihood that superintelligent AI will come into existence in the future. To make this argument, a new principle is introduced: t...	2
DEEP WORD EMBEDDINGS FOR VISUAL SPEECH RECOGNITION Themos Stafylakis and Georgios Tzimiropoulos Computer Vision Laboratory, University of Nottingham, UK arXiv:1710.11201v1 [] 30 Oct 2017 ABSTRACT In this paper we present a deep learning architecture for extracting word embeddings for visual speech recognition. The em...	7
Online Dominating Set ∗ Joan Boyar 1 Stephan J. Eidenbenz 2 Michal Kotrbčı́k 1 arXiv:1604.05172v1 [] 18 Apr 2016 1 Lene M. Favrholdt 1 Kim S. Larsen 1 University of Southern Denmark, Odense, Denmark {joan,lenem,kotrbcik,kslarsen}@imada.sdu.dk 2 Los Alamos National Laboratory, Los Alamos, NM, USA eidenben@lanl....	8
A subsystems approach for parameter estimation of ODE models of hybrid systems Anastasis Georgoulas Allan Clark SynthSys— Synthetic and Systems Biology University of Edinburgh Edinburgh, United Kingdom Anastasis.Georgoulas@ed.ac.uk A.D.Clark@ed.ac.uk Andrea Ocone A.Ocone@ed.ac.uk Stephen Gilmore Guido Sanguinetti...	5
Hohmann Transfer via Constrained Optimization Li Xie∗ State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power University, Beijing 102206, P.R. China arXiv:1712.01512v1 [] 5 Dec 2017 Yiqun Zhang† and Junyan Xu‡ Beijing Institute of Electronic Systems Engineeri...	3
DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning Wenhan Xiong and Thien Hoang and William Yang Wang Department of Computer Science University of California, Santa Barbara Santa Barbara, CA 93106 USA {xwhan,william}@cs.ucsb.edu, thienhoang@umail.ucsb.edu arXiv:1707.06690v2 [cs.CL] 8 Jan 2018 Abs...	2
ON THE LENGTH AND DEPTH OF FINITE GROUPS TIMOTHY C. BURNESS, MARTIN W. LIEBECK, AND ANER SHALEV arXiv:1802.02194v1 [] 6 Feb 2018 With an appendix by D.R. Heath-Brown Abstract. An unrefinable chain of a finite group G is a chain of subgroups G = G0 > G1 > · · · > Gt = 1, where each Gi is a maximal subgroup of Gi−1 . T...	4
KNAPSACK PROBLEMS FOR WREATH PRODUCTS arXiv:1709.09598v2 [] 2 Oct 2017 MOSES GANARDI, DANIEL KÖNIG, MARKUS LOHREY, AND GEORG ZETZSCHE Abstract. In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It ...	4
arXiv:1510.05886v2 [cs.DM] 13 Mar 2017 Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set Zhao Zhang1 1 Jiao Zhou2 Ker-I Ko3 Ding-zhu Du4 College of Mathematics Physics and Information Engineering, Zhejiang Normal University Jinhua, Zhejiang, 321004, China 2 College of Mathematics and Syst...	8
arXiv:0711.4444v2 [cs.MS] 29 Nov 2007 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Building the Tangent and Adjoint codes of the Ocean General Circulation Model OPA with the Automatic Differentiation tool TAPENADE M.H. Tber — L. Hascoët — A. Vidard — B. Dauvergne N° 6372 Novembre 2007 Thème NUM ...	5
Fine-Grained Complexity for Sparse Graphs Udit Agarwal ⋆ and Vijaya Ramachandran∗ arXiv:1611.07008v3 [] 19 Oct 2017 October 20, 2017 Abstract We consider the fine-grained complexity of sparse graph problems that currently have Õ(mn) time algorithms, where m is the number of edges and n is the number of vertices i...	8
An Emptiness Algorithm for Regular Types with Set Operators arXiv:cs/9811015v1 [cs.LO] 11 Nov 1998 Lunjin Lu and John G. Cleary Department of Computer Science University of Waikato Hamilton, New Zealand Phone: +64-838-4627/4378 {lunjin,jcleary}@cs.waikato.ac.nz Abstract. An algorithm to decide the emptiness of a reg...	6
1 A Learning-to-Infer Method for Real-Time Power Grid Topology Identification arXiv:1710.07818v1 [cs.LG] 21 Oct 2017 Yue Zhao, Member, IEEE, Jianshu Chen, Member, IEEE, and H. Vincent Poor, Fellow, IEEE Abstract—Identifying arbitrary topologies of power networks in real time is a computationally hard problem due to...	2
A PROBABILISTIC ℓ1 METHOD FOR CLUSTERING HIGH DIMENSIONAL DATA arXiv:1504.01294v2 [] 22 Apr 2016 TSVETAN ASAMOV AND ADI BEN–ISRAEL Abstract. In general, the clustering problem is NP–hard, and global optimality cannot be established for non–trivial instances. For high–dimensional data, distance–based methods for clust...	10
Best Practices for Applying Deep Learning to Novel Applications Leslie N. Smith Navy Center for Applied Research in Artificial Intelligence U.S. Naval Research Laboratory, Code 5514 Washington, DC 20375 leslie.smith@nrl.navy.mil ABSTRACT This report is targeted to groups who are subject matter experts in their applicat...	9
International Journal on Bioinformatics & Biosciences (IJBB) Vol.3, No.2, June 2013 Application of three graph Laplacian based semisupervised learning methods to protein function prediction problem Loc Tran University of Minnesota tran0398@umn.edu Abstract: Protein function prediction is the important problem in mode...	5
XQOWL: An Extension of XQuery for OWL Querying and Reasoning Jesús M. Almendros-Jiménez∗ Dpto. de Informática University of Almería 04120-Almería, SPAIN jalmen@ual.es One of the main aims of the so-called Web of Data is to be able to handle heterogeneous resources where data can be expressed in either XML or RDF. The ...	6
Efficient Column Generation for Cell Detection and Segmentation arXiv:1709.07337v1 [] 21 Sep 2017 Chong Zhanga,∗, Shaofei Wangb , Miguel A. Gonzalez-Ballestera,c , Julian Yarkonyd,∗ a SimBioSys, DTIC, Universitat Pompeu Fabra, Barcelona, Spain b A&E Technologies, Beijing, China c ICREA, Spain d Experian Data Lab, US...	1
Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs arXiv:1701.08315v1 [] 28 Jan 2017 Baigong Zheng Oregon State University zhengb@eecs.oregonstate.edu Abstract We present the first polynomial-time approximation schemes, i.e., (1 + )-approximation ...	8
1 Guiding Designs of Self-Organizing Swarms: Interactive and Automated Approaches arXiv:1308.3400v1 [] 14 Aug 2013 Hiroki Sayama Collective Dynamics of Complex Systems Research Group Binghamton University, State University of New York Binghamton, NY 13902-6000, USA sayama@binghamton.edu Summary. Self-organization of ...	9
1 Multiplexing Analysis of Millimeter-Wave Massive MIMO Systems arXiv:1801.02987v2 [] 21 Jan 2018 Dian-Wu Yue, Ha H. Nguyen and Shuai Xu Abstract—This paper is concerned with spatial multiplexing analysis for millimeter-wave (mmWave) massive MIMO systems. For a single-user mmWave system employing distributed antenn...	7
Fast Computation of Graph Edit Distance Xiaoyang Chen† , Hongwei Huo∗† , Jun Huan‡ , Jeffrey Scott Vitter arXiv:1709.10305v1 [] 29 Sep 2017 † § Dept. of Computer Science, Xidian University, chenxyu1991@gmail.com, hwhuo@mail.xidian.edu.cn ‡ Dept. of Electrical Engineering and Computer Science, The University of Kans...	8
Pure state ‘really’ informationally complete with rank-1 POVM Yu Wang1,2 , Yun Shang1,3 1 arXiv:1711.07585v1 [quant-ph] 21 Nov 2017 2 Institute of Mathematics, AMSS, CAS, Beijing, 100190, China, University of Chinese Academy of Sciences, Beijing, 100049, China 3 NCMIS, AMSS, CAS, Beijing, 100190, China. shangyun602@...	7
IEEE TRANSACTIONS ON COMMUNICATIONS 1 A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding Hanxu Hou, Member, IEEE, Yunghsiang S. Han, Fellow, IEEE, Kenneth W. Shum, Senior Member, IEEE and Hui Li Member, IEEE, arXiv:1803.03508v1 [] 9 Mar 2018 Abstract Array codes have been widely employed in storag...	7
arXiv:1404.1901v4 [] 23 Oct 2017 INVERTIBLE IDEALS AND GAUSSIAN SEMIRINGS SHABAN GHALANDARZADEH, PEYMAN NASEHPOUR, AND RAFIEH RAZAVI Abstract. In the first section, we introduce the notions of fractional and invertible ideals of semirings and characterize invertible ideals of a semidomain. In section two, we define Pr...	0
A Differential Evaluation Markov Chain Monte Carlo algorithm for Bayesian Model Updating M. Sherri a, I. Boulkaibet b, T. Marwala b, M. I. Friswell c, a Department of Mechanical Engineering Science, University of Johannesburg, PO Box 524, Auckland Park 2006, South Africa. b Institute of Intelligent Systems, University...	5
arXiv:1410.6843v2 [] 22 Apr 2016 Posteriors, conjugacy, and exponential families for completely random measures Tamara Broderick Ashia C. Wilson Michael I. Jordan April 25, 2016 Abstract We demonstrate how to calculate posteriors for general Bayesian nonparametric priors and likelihoods based on completely random m...	10
Ergodicity and Accuracy of Optimal Particle Filters for Bayesian Data Assimilation arXiv:1611.08761v1 [math.PR] 26 Nov 2016 March 7, 2018 D. Kelly⋆ and A.M. Stuart† ⋆ † New York University, Email: dtbkelly@gmail.com California Institute of Technology, Email: astuart@caltech.edu Abstract Data assimilation refers to...	10
1 An Approximate ML Detector for MIMO Channels Corrupted by Phase Noise arXiv:1708.02321v1 [] 7 Aug 2017 Richard Combes and Sheng Yang Abstract We consider the multiple-input multiple-output (MIMO) communication channel impaired by phase noises at both the transmitter and receiver. We focus on the maximum likelihoo...	7
arXiv:1504.00941v2 [] 7 Apr 2015 A Simple Way to Initialize Recurrent Networks of Rectified Linear Units Quoc V. Le, Navdeep Jaitly, Geoffrey E. Hinton Google Abstract Learning long term dependencies in recurrent networks is difficult due to vanishing and exploding gradients. To overcome this difficulty, researchers ...	9
1 Online Thevenin Equivalent Parameter Estimation using Nonlinear and Linear Recursive Least Square Algorithm Md. Umar Hashmi Department of Energy Science & Engineering IIT Bombay Bombay, Maharashtra umar.hashmi123@gmail.com Rahul Choudhary Department of Systems and Control IIT Bombay Bombay, Maharashtra rahulchoudha...	3
An economic approach to vehicle dispatching for ride sharing Mengjing Chen, Weiran Shen, Pingzhong Tang, and Song Zuo IIIS, Tsinghua University ∗ arXiv:1707.01625v2 [] 1 Mar 2018 March 2, 2018 Abstract Over the past few years, ride-sharing has emerged as an effective way to relieve traffic congestion. A key problem f...	3
Signal Amplitude Estimation and Detection from Unlabeled Binary Quantized Samples Guanyu Wang, Jiang Zhu, Rick S. Blum, Peter Willett, arXiv:1706.01174v3 [] 8 Mar 2018 Stefano Marano, Vincenzo Matta, Paolo Braca Abstract Signal amplitude estimation and detection from unlabeled quantized binary samples are studied, as...	7
Reliable Uncertain Evidence Modeling in Bayesian Networks by Credal Networks arXiv:1802.05639v1 [] 15 Feb 2018 Sabina Marchetti Sapienza University of Rome Rome (Italy) sabina.marchetti@uniroma1.it Alessandro Antonucci IDSIA Lugano (Switzerland) alessandro@idsia.ch February 16, 2018 Abstract A reliable modeling of unc...	2
1 Supervisory Control of Discrete-event Systems under Attacks arXiv:1701.00881v1 [] 4 Jan 2017 Masashi Wakaiki, Paulo Tabuada, and João P. Hespanha Abstract We consider a supervisory control problem for discrete-event systems, in which an attacker corrupts the symbols that are observed by the supervisor. We show t...	3
arXiv:1709.05976v3 [cs.LG] 10 Nov 2017 Leveraging Distributional Semantics for Multi-Label Learning Rahul Wadbude Vivek Gupta Piyush Rai IIT Kanpur warahul@iitk.ac.in Microsoft Research t-vigu@microsoft.com IIT Kanpur piyush@iitk.ac.in Nagarajan Natarajan Harish Karnick Prateek Jain Microsoft Research t-nanat...	2
arXiv:1704.02043v2 [math.AG] 9 Nov 2017 COMMENSURATING ACTIONS OF BIRATIONAL GROUPS AND GROUPS OF PSEUDO-AUTOMORPHISMS SERGE CANTAT AND YVES DE CORNULIER A BSTRACT. Pseudo-automorphisms are birational transformations acting as regular automorphisms in codimension 1. We import ideas from geometric group theory to study...	4
1 A Generalized Framework for Kullback-Leibler Markov Aggregation Abstract—This paper proposes an information-theoretic cost function for aggregating a Markov chain via a (possibly stochastic) mapping. The cost function is motivated by two objectives: 1) The process obtained by observing the Markov chain through the ...	7
A tool for stability and power sharing analysis of a generalized class of droop controllers for high-voltage direct-current transmission systems Daniele Zonetti, Romeo Ortega and Johannes Schiffer arXiv:1609.03149v2 [] 20 Mar 2017 Abstract The problem of primary control of high-voltage direct current transmission sys...	3
arXiv:1412.4056v2 [] 19 May 2016 Blind system identification using kernel-based methods? Giulio Bottegal, Riccardo S. Risuleo, and Håkan Hjalmarsson ∗ March 15, 2018 Abstract We propose a new method for blind system identification (BSI). Resorting to a Gaussian regression framework, we model the impulse response o...	3
Variable screening with multiple studies Tianzhou Ma1 , Zhao Ren2 and George C. Tseng1 1 Department of Biostatistics, University of Pittsburgh 2 Department of Statistics, University of Pittsburgh arXiv:1710.03892v1 [stat.ME] 11 Oct 2017 Abstract Advancement in technology has generated abundant high-dimensional data ...	10
ON HIERARCHICAL HYPERBOLICITY OF CUBICAL GROUPS arXiv:1609.01313v2 [] 23 Jan 2018 MARK F HAGEN AND TIM SUSSE Abstract. Let X be a proper CAT(0) cube complex admitting a proper cocompact action by a group G. We give three conditions on the action, any one of which ensures that X has a factor system in the sense of [B...	4
arXiv:1609.00830v1 [] 3 Sep 2016 COHEN-MACAULAY LEXSEGMENT COMPLEXES IN ARBITRARY CODIMENSION HASSAN HAGHIGHI, SIAMAK YASSEMI, AND RAHIM ZAARE-NAHANDI Abstract. We characterize pure lexsegment complexes which are CohenMacaulay in arbitrary codimension. More precisely, we prove that any lexsegment complex is Cohen-Maca...	0
arXiv:1711.04036v1 [] 10 Nov 2017 Physiological and behavioral profiling for nociceptive pain estimation using personalized multitask learning Daniel Lopez-Martinez1,2 , Ognjen (Oggi) Rudovic2 , Rosalind Picard2 1 Harvard-MIT Health Sciences and Technology, dlmocdm@mit.edu 2 Affective Computing group, MIT Media Lab, ...	2
Mathematics Is Imprecise Prabhakar Ragde Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, Canada plragde@uwaterloo.ca We commonly think of mathematics as bringing precision to application domains, but its relationship with computer science is more complex. This experience report on the use...	6
An Application of the EM-algorithm to Approximate Empirical Distributions of Financial Indices with the Gaussian Mixtures arXiv:1607.01033v1 [] 29 Jun 2016 Sergey Tarasenko Abstract—In this study I briefly illustrate application of the Gaussian mixtures to approximate empirical distributions of financial indices (DA...	5
Critical Parameters in Particle Swarm Optimisation arXiv:1511.06248v1 [] 19 Nov 2015 J. Michael Herrmann∗, Adam Erskine, Thomas Joyce Institute for Perception, Action and Behaviour School of Informatics, The University of Edinburgh 10 Crichton St, Edinburgh EH8 9AB, Scotland, U.K. Abstract Particle swarm optimisatio...	9
GENERALIZED U-FACTORIZATION IN COMMUTATIVE RINGS WITH ZERO-DIVISORS arXiv:1312.7403v1 [] 28 Dec 2013 CHRISTOPHER PARK MOONEY Abstract. Recently substantial progress has been made on generalized factorization techniques in integral domains, in particular τ -factorization. There has also been advances made in investiga...	0
Constructing Datasets for Multi-hop Reading Comprehension Across Documents Johannes Welbl Pontus Stenetorp Sebastian Riedel arXiv:1710.06481v1 [cs.CL] 17 Oct 2017 University College London {j.welbl,p.stenetorp,s.riedel}@cs.ucl.ac.uk Abstract Most Reading Comprehension methods limit themselves to queries which can ...	2
BALANCED ALLOCATION: PATIENCE IS NOT A VIRTUE∗ arXiv:1602.08298v2 [] 22 Jan 2018 JOHN AUGUSTINE† , WILLIAM K. MOSES JR.‡ , AMANDA REDLICH§ , AND ELI UPFAL¶ Abstract. Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm Greedy[d] of Azar et al. places each ball...	8
arXiv:1401.0062v4 [] 23 Jun 2016 Bernoulli 22(4), 2016, 2301–2324 DOI: 10.3150/15-BEJ729 The combinatorial structure of beta negative binomial processes CREIGHTON HEAUKULANI1 and DANIEL M. ROY2 1 Department of Engineering, University of Cambridge, Trumpington Street, Cambridge, CB2 1PZ, United Kingdom. E-mail: ckh28...	10
arXiv:1509.02612v4 [] 11 Mar 2016 ROOTS OF UNITY IN ORDERS H. W. LENSTRA, JR. AND A. SILVERBERG Communicated by John Cremona Abstract. We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order....	0
Published as a conference paper at ICLR 2018 F EW- SHOT AUTOREGRESSIVE D ENSITY E STIMATION : TOWARDS LEARNING TO LEARN DISTRIBUTIONS S. Reed, Y. Chen, T. Paine, A. van den Oord, S. M. A. Eslami, D. Rezende, O. Vinyals, N. de Freitas {reedscot,yutianc,tpaine}@google.com arXiv:1710.10304v4 [] 28 Feb 2018 A BSTRACT De...	9
Capri: A Control System for Approximate Programs Swarnendu Biswas Yan Pei Donald S. Fussell University of Texas at Austin (USA) University of Texas at Austin (USA) University of Texas at Austin (USA) sbiswas@ices.utexas.edu ypei@cs.utexas.edu fussell@cs.utexas.edu Keshav Pingali arXiv:1706.00767v1 [] 2 Jun 20...	6
Day-Ahead Solar Forecasting Based on Multi-level Solar Measurements Mohana Alanazi, Mohsen Mahoor, Amin Khodaei Department of Electrical and Computer Engineering University of Denver Denver, USA mohana.alanazi@du.edu, mohsen.mahoor@du.edu, amin.khodaei@du.edu Abstract—The growing proliferation in solar deployment, esp...	2
Virtual Observatory: From Concept to Implementation S.G. Djorgovski1,2 and R. Williams2 arXiv:astro-ph/0504006v1 1 Apr 2005 1 Division of Physics, Mathematics, and Astronomy Center for Advanced Computing Research California Institute of Technology Pasadena, CA 91125, USA 2 Abstract. We review the origins of the Vir...	5
Non-constant bounded holomorphic functions of hyperbolic numbers – Candidates for hyperbolic activation functions arXiv:1306.1653v1 [] 7 Jun 2013 * Eckhard Hitzer (University of Fukui) Abstract– The Liouville theorem states that bounded holomorphic complex functions are necessarily constant. Holomorphic functions ful...	9
ON THE GROUP OF AUTOMORPHISMS OF THE BRANDT λ0 -EXTENSION OF A MONOID WITH ZERO arXiv:1609.06085v1 [] 20 Sep 2016 OLEG GUTIK Abstract. The group of automorphisms of the Brandt λ0 -extension Bλ0 (S) of an arbitrary monoid S with zero is described. In particular we show that the group of automorphisms Aut(Bλ0 (S)) of ...	4
arXiv:1712.06393v2 [] 28 Dec 2017 Graph-based Transform Coding with Application to Image Compression Giulia Fracastoro, Dorina Thanou, Pascal Frossard December 29, 2017 Abstract In this paper, we propose a new graph-based coding framework and illustrate its application to image compression. Our approach relies on the ...	7
Numerical modeling of the friction stir welding process: a literature review Diogo Mariano Neto • Pedro Neto D. M. Neto, P. Neto Department of Mechanical Engineering (CEMUC) - POLO II, University of Coimbra, 3030-788 Coimbra, Portugal Tel.: +351 239 790 700 Fax: +351 239 790 701 E-mail: diogo.neto@dem.uc.pt Correspond...	5
arXiv:1712.06727v2 [] 8 Feb 2018 On parabolic subgroups of Artin–Tits groups of spherical type Marı́a Cumplido, Volker Gebhardt, Juan González-Meneses and Bert Wiest∗ February 8, 2018 Abstract We show that, in an Artin–Tits group of spherical type, the intersection of two parabolic subgroups is a parabolic subgroup....	4
Sparse Coding by Spiking Neural Networks: Convergence Theory and Computational Results arXiv:1705.05475v1 [cs.LG] 15 May 2017 Ping Tak Peter Tang, Tsung-Han Lin, and Mike Davies Intel Corporation {peter.tang, tsung-han.lin, mike.davies}@intel.com Abstract In a spiking neural network (SNN), individual neurons operate ...	9
Fractional Order Load-Frequency Control of Interconnected Power Systems Using Chaotic Multi-objective Optimization Indranil Pana,b and Saptarshi Dasb,c,* a) Centre for Energy Studies, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016, India. b) Department of Power Engineering, Jadavpur University, Salt ...	9
arXiv:1312.4149v1 [] 15 Dec 2013 Autonomous Quantum Perceptron Neural Network Alaa Sagheer 1 and Mohammed Zidan Department of Mathematics Center for Artificial Intelligence and RObotics (CAIRO) Faculty of Science, Aswan University, Aswan, Egypt Email: alaa@cairo-aswu.edu.eg Abstract:Recently, with the rapid developmen...	9
1 Energy-Efficient Cooperative Cognitive Relaying Schemes for Cognitive Radio Networks arXiv:1406.2255v3 [cs.NI] 26 Oct 2017 Ahmed El Shafie, Student Member, IEEE, Tamer Khattab, Member, IEEE, Amr El-Keyi, Member, IEEE Abstract—We investigate a cognitive radio network in which a primary user (PU) may cooperate with...	7
arXiv:1711.11383v1 [stat.ML] 30 Nov 2017 Learning to Learn from Weak Supervision by Full Supervision Mostafa Dehghani University of Amsterdam dehghani@uva.nl Aliaksei Severyn, Sascha Rothe Google Research {severyn,rothe}@google.com Jaap Kamps University of Amsterdam kamps@uva.nl Abstract In this paper, we propose ...	2
Fine-grained acceleration control for autonomous intersection management using deep reinforcement learning arXiv:1705.10432v1 [] 30 May 2017 Hamid Mirzaei Dept. of Computer Science University of California, Irvine mirzaeib@uci.edu Abstract—Recent advances in combining deep learning and Reinforcement Learning have sh...	2
1 Cluster-Seeking James-Stein Estimators arXiv:1602.00542v4 [] 16 Mar 2018 K. Pavan Srinath and Ramji Venkataramanan Abstract—This paper considers the problem of estimating a high-dimensional vector of parameters θ ∈ Rn from a noisy observation. The noise vector is i.i.d. Gaussian with known variance. For a squared...	7
On PROGRESS Operation How to Make Object-Oriented Programming System More Object-Oriented (DRAFT) Evgeniy Grigoriev www.RxO project.com Grigoriev.E@gmail.com Keywords: Object-oriented paradigm, Von Neumann architecture, linear addressable memory, persistent object, modifiable object, relational data model, RxO, stati...	6
SUBMITTED TO IEEE-SPM, APRIL 2017 1 Generative Adversarial Networks: An Overview arXiv:1710.07035v1 [] 19 Oct 2017 Antonia Creswell§ , Tom White¶ , Vincent Dumoulin‡ , Kai Arulkumaran§ , Biswa Sengupta†§ and Anil A Bharath§ , Member IEEE § BICV Group, Dept. of Bioengineering, Imperial College London ¶ School of Des...	1
arXiv:1707.06203v2 [cs.LG] 14 Feb 2018 Imagination-Augmented Agents for Deep Reinforcement Learning Théophane Weber∗ Sébastien Racanière∗ David P. Reichert∗ Lars Buesing Arthur Guez Danilo Rezende Adria Puigdomènech Badia Oriol Vinyals Nicolas Heess Yujia Li Razvan Pascanu Peter Battaglia Demis Hassabis David Silver ...	2
arXiv:1704.01960v1 [physics.med-ph] 29 Mar 2017 A coupled mitral valve – left ventricle model with fluid-structure interaction Hao Gao School of Mathematics and Statistics, University of Glasgow, UK Liuyang Feng School of Mathematics and Statistics, University of Glasgow, UK Nan Qi School of Mathematics and Statisti...	5
Published as a conference paper at ICLR 2017 R ECURRENT E NVIRONMENT S IMULATORS Silvia Chiappa, Sébastien Racaniere, Daan Wierstra & Shakir Mohamed DeepMind, London, UK {csilvia, sracaniere, wierstra, shakir}@google.com arXiv:1704.02254v2 [] 19 Apr 2017 A BSTRACT Models that can simulate how environments change in ...	2
Further insights into the damping-induced self-recovery phenomenon Tejas Kotwal ∗, Roshail Gerard †and Ravi Banavar ‡ arXiv:1709.05596v4 [] 11 Jan 2018 January 12, 2018 1 Abstract In a series of papers [1, 2, 3, 4], D. E. Chang, et al., proved and experimentally demonstrated a phenomenon they termed “damping-indu...	3
A Proposed Algorithm for Minimum Vertex Cover Problem and its Testing Gang Hu Email: garyhu3@163.com Abstract The paper presents an algorithm for minimum vertex cover problem, which is an NP-Complete problem. The algorithm computes a minimum vertex cover of each input simple graph. Tested by the attached MATLAB progra...	8
arXiv:1711.01057v2 [] 13 Nov 2017 Open subgroups of the automorphism group of a right-angled building Tom De Medts Ana C. Silva November 15, 2017 Abstract We study the group of type-preserving automorphisms of a rightangled building, in particular when the building is locally ﬁnite. Our aim is to characterize the p...	4
ON THE MULTI-DIMENSIONAL ELEPHANT RANDOM WALK arXiv:1709.07345v1 [math.PR] 21 Sep 2017 BERNARD BERCU AND LUCILE LAULIN Abstract. The purpose of this paper is to investigate the asymptotic behavior of the multi-dimensional elephant random walk (MERW). It is a non-Markovian random walk which has a complete memory of it...	10

Subsets and Splits

No community queries yet

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