Split (3)

train · 27.2k rows

text stringlengths 2.85k 2.55M	label int64 0 10
Astroinformatics c 2017 International Astronomical Union Proceedings IAU Symposium No. 325, 2017 M. Brescia, S. G. Djorgovski, E. Feigelson, G. Longo & S. Cavuoti. DOI: 00.0000/X000000000000000X What can the programming language Rust do for astrophysics? Sergi Blanco-Cuaresma1 and Emeline Bolmont2 1 arXiv:1702.02951v...	6
1 Flatness-based control of a two-degree-of-freedom platform with pneumatic artificial muscles arXiv:1703.05503v1 [cs.SY] 16 Mar 2017 David Bou Saba, Paolo Massioni, Eric Bideaux, and Xavier Brun Abstract—Pneumatic artificial muscles are a quite interesting type of actuators which have a very high power-to-weight a...	3
A Simple Semantics for Haskell Overloading J. Garrett Morris arXiv:1612.08199v1 [cs.PL] 24 Dec 2016 University of Edinburgh Garrett.Morris@ed.ac.uk Abstract 1.1 Dictionary-Passing and its Disadvantages As originally proposed, type classes provide overloading and adhoc definition, but can still be understood (and i...	6
arXiv:1405.6963v1 [math.AC] 27 May 2014 PSEUDO-GORENSTEIN AND LEVEL HIBI RINGS VIVIANA ENE, JÜRGEN HERZOG, TAKAYUKI HIBI AND SARA SAEEDI MADANI Abstract. We introduce pseudo-Gorenstein rings and characterize those Hibi rings attached to a finite distributive lattice L which are pseudo-Gorenstein. The characterization...	0
Towards Advanced Phenotypic Mutations in Cartesian Genetic Programming arXiv:1803.06127v1 [cs.NE] 16 Mar 2018 Roman Kalkreuth TU Dortmund University, Department of Computer Science, Dortmund, Germany Roman.Kalkreuth@tu-dortmund.de Abstract. Cartesian Genetic Programming is often used with a point mutation as the sol...	9
A Metamodel of Unit Testing for Object-Oriented Programming Languages arXiv:0912.3583v1 [cs.PL] 18 Dec 2009 Martin Lévesque Dept. of Computer Science University of Quebec at Montréal Montréal, Québec, Canada Email: levesque.martin@gmail.com ABSTRACT A unit test is a method for verifying the accuracy and the proper fu...	6
lpopt: A Rule Optimization Tool for Answer Set Programming arXiv:1608.05675v2 [cs.LO] 23 Aug 2016 Manuel Bichler, Michael Morak, and Stefan Woltran TU Wien, Vienna, Austria {surname}@dbai.tuwien.ac.at Abstract. State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-g...	6
The challenge of simultaneous object detection and pose estimation: a comparative study Daniel Oñoro-Rubio, Roberto J. López-Sastre, Carolina Redondo-Cabrera and Pedro Gil-Jiménez GRAM, University of Alcalá, Alcalá de Henares, 28805, Spain arXiv:1801.08110v1 [cs.CV] 24 Jan 2018 Abstract Detecting objects and est...	1
Network Sketching: Exploiting Binary Structure in Deep CNNs Yiwen Guo1 , Anbang Yao1 , Hao Zhao2,1 , Yurong Chen1 1 Intel Labs China, 2 Department of Electronic Engineering, Tsinghua University arXiv:1706.02021v1 [cs.NE] 7 Jun 2017 {yiwen.guo,anbang.yao,hao.zhao,yurong.chen}@intel.com Abstract Convolutional neural n...	9
arXiv:1710.00892v1 [cs.LG] 2 Oct 2017 Rényi Differential Privacy Mechanisms for Posterior Sampling Joseph Geumlek University of California, San Diego jgeumlek@cs.ucsd.edu Shuang Song University of California, San Diego shs037@eng.ucsd.edu Kamalika Chaudhuri University of California, San Diego kamalika@cs.ucsd.edu Oc...	2
FQAM-FBMC Design and Its Application to Machine Type Communication Yinan Qi, Milos Tesanovic Samsung Electronics R&D Institute UK, Staines, Middlesex TW18 4QE, UK {yinan.qi, m.tesanovic}@samsung.com Abstract—In this paper, we propose a novel waveform design which efficiently combines two air interface components: Frequ...	7
1 An SDR Implementation of a Visible Light Communication System Based on the IEEE 802.15.7 Standard arXiv:1803.07337v1 [eess.SP] 20 Mar 2018 ∗ Centre Jorge Baranda∗ , Pol Henarejos∗ , Ciprian G. Gavrincea∗ Tecnològic de Telecomunicacions de Catalunya (CTTC), Castelldefels, Barcelona (Spain) Email: {jorge.baranda, ...	7
New avenue to the Parton Distribution Functions: Self-Organizing Maps arXiv:0810.2598v2 [hep-ph] 2 Nov 2008 H. Honkanena,b,∗ , S. Liutia,† a Department of Physics, University of Virginia, P.O. Box 400714, Charlottesville, VA 22904-4714, USA b Department of Physics and Astronomy, Iowa State University, Ames, IA 5001...	5
Published in Journal of Telematics and Informatics, Vol 4, No 1 (2016): March 2016 Abstract: http://section.iaesonline.com/index.php/JTI/article/view/188 One-Minute Derivation of The Conjugate Gradient Algorithm Muhammad Ali Raza Anjum Army Public College of Management and Sciences Rawalpindi, PAKISTAN e-mail: ali.raz...	8
arXiv:1511.02534v2 [math.ST] 31 Mar 2017 Order Determination of Large Dimensional Dynamic Factor Model Z. D. Baia , Chen Wangb , Ya Xuec and Matthew Hardingd Northeast Normal Universitya , University of Cambridgeb and University of California, Irvinec,d April 3, 2017 Abstract Consider the following dynamic factor mod...	10
Coding-theorem Like Behaviour and Emergence of the Universal Distribution from Resource-bounded Algorithmic Probability Hector Zenil1,2,3∗ Liliana Badillo 4 Santiago Hernández-Orozco 2,3,4 and Francisco Hernández-Quiroz 5 1 Department of Computer Science, University of Oxford, Oxford, U.K. Algorithmic Dynamics Lab, ...	2
Analyzing Large Biological Datasets with an Improved Algorithm for MIC Shuliang Wang, Yiping Zhao School of Software, Beijing Institute of Technology, Beijing 100081, China Abstract: A computational framework utilizes the traditional similarity measures for mining the significant relationships in biological annotation...	5
THE STATUS OF THE ZASSENHAUS CONJECTURE FOR SMALL GROUPS arXiv:1609.00042v1 [math.RA] 31 Aug 2016 ANDREAS BÄCHLE∗ , ALLEN HERMAN† , ALEXANDER KONOVALOV, LEO MARGOLIS‡ , AND GURMAIL SINGH Abstract. We identify all small groups of order up to 288 in the GAP Library for which the Zassenhaus conjecture on rational conju...	4
Latent nested nonparametric priors arXiv:1801.05048v1 [math.ST] 15 Jan 2018 Federico Camerlenghi Department of Economics, Management and Statistics, University of Milano–Bicocca and David B. Dunson Department of Statistical Science, Duke University and Antonio Lijoi and Igor Prünster∗ Department of Decision Sciences...	10
Equivalence Classes of Optimal Structures in HP Protein Models Including Side Chains arXiv:0910.3848v1 [cs.CE] 20 Oct 2009 Martin Mann, Rolf Backofen, and Sebastian Will University of Freiburg, Bioinformatics, 79110 Freiburg, Germany, {mmann,backofen,will}@informatik.uni-freiburg.de Abstract. Lattice protein models,...	5
Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes arXiv:1707.08807v1 [cs.DS] 27 Jul 2017 Fabian Kuhn∗ Konstantinos Panagiotou† Pascal Su‡ Abstract We investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal tre...	8
On computing tree and path decompositions with metric constraints on the bags Guillaume Ducoffe1,2 , Sylvain Legay3 , and Nicolas Nisse2,1 arXiv:1601.01958v1 [cs.CC] 8 Jan 2016 1 Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, 06900 Sophia Antipolis, France 2 INRIA, France 3 LRI, Univ Paris Sud, Université Paris-S...	8
Robustness analysis of a Maximum Correntropy framework for linear regression arXiv:1703.04829v2 [cs.SY] 31 Aug 2017 Laurent Bako a a Laboratoire Ampère – Ecole Centrale de Lyon – Université de Lyon, France Abstract In this paper we formulate a solution of the robust linear regression problem in a general framework ...	3
Generating Natural Language Inference Chains Vladyslav Kolesnyk and Tim Rocktäschel and Sebastian Riedel University College London London, UK arXiv:1606.01404v1 [cs.CL] 4 Jun 2016 vladyslav.kolesnyk.12@ucl.ac.uk, {t.rocktaschel,s.riedel}@cs.ucl.ac.uk Abstract The ability to reason with natural language is a fundam...	9
Approximating LZ77 via Small-Space Multiple-Pattern Matching Johannes Fischer∗1 , Travis Gagie2 , Pawel Gawrychowski†3 , and Tomasz Kociumaka‡3 arXiv:1504.06647v2 [cs.DS] 10 Sep 2015 1 TU Dortmund, Germany johannes.fischer@cs.tu-dortmund.de 2 Helsinki Institute for Information Technology (HIIT), Department of Comput...	8
Going Deeper in Spiking Neural Networks: VGG and Residual Architectures Abhronil Sengupta 1 Yuting Ye 2 Robert Wang 2 Chiao Liu 2 Kaushik Roy 1 arXiv:1802.02627v1 [cs.CV] 7 Feb 2018 Abstract Over the past few years, Spiking Neural Networks (SNNs) have become popular as a possible pathway to enable low-power event-dr...	1
arXiv:1702.00561v1 [math.GR] 2 Feb 2017 Autocommuting probability of a finite group Parama Dutta and Rajat Kanti Nath∗ Department of Mathematical Sciences, Tezpur University, Napaam-784028, Sonitpur, Assam, India. Emails: parama@gonitsora.com and rajatkantinath@yahoo.com Abstract Let G be a finite group and Aut(G) t...	4
A tight lower bound for Vertex Planarization on graphs of bounded treewidth Marcin Pilipczuk∗ arXiv:1511.08283v1 [cs.DS] 26 Nov 2015 Abstract In the Vertex Planarization problem one asks to delete the minimum possible number of vertices from an input graph to obtain a planar graph. The parameterized complexity of thi...	8
arXiv:1711.02953v1 [math.GR] 8 Nov 2017 Classification of pro-p PD2 pairs and the pro-p curve complex Gareth Wilkes November 9, 2017 Abstract We classify pro-p Poincaré duality pairs in dimension two. We then use this classification to build a pro-p analogue of the curve complex and establish its basic properties. I...	4
Asymptotics of selective inference arXiv:1501.03588v2 [math.ST] 4 Aug 2016 Xiaoying Tian, Jonathan Taylor∗ Department of Statistics Stanford University Sequoia Hall Stanford, CA 94305, USA e-mail: xtian@stanford.edu jonathan.taylor@stanford.edu Abstract: In this paper, we seek to establish asymptotic results for sele...	10
DeepMovie: Using Optical Flow and Deep Neural Networks to Stylize Movies Alexander G. Anderson1 , Cory P. Berg1 , Daniel P. Mossing1 , and Bruno A. Olshausen1 arXiv:1605.08153v1 [cs.CV] 26 May 2016 1 Redwood Center for Theoretical Neuroscience, University of California, Berkeley May 27, 2016 Abstract A recent paper...	9
Asymptotic properties of a componentwise ARH(1) plug-in predictor Javier Álvarez-Liébana1 , Denis Bosq2 and M. Dolores Ruiz-Medina1 arXiv:1706.06498v1 [math.ST] 20 Jun 2017 2nd April 2018 1 Department of Statistics and O. R., University of Granada, Spain. LSTA, Université Pierre et Marie Curie-Paris 6, Paris, Fra...	10
arXiv:cs/0603028v1 [cs.PL] 8 Mar 2006 On the tree-transformation power of XSLT Wim Janssen Alexandr Korlyukovd Jan Van den Bussche∗ Abstract XSLT is a standard rule-based programming language for expressing transformations of XML data. The language is currently in transition from version 1.0 to 2.0. In order to und...	2
arXiv:1711.01090v1 [math.GR] 3 Nov 2017 FACTORIZATIONS OF ALMOST SIMPLE GROUPS WITH A FACTOR HAVING MANY NONSOLVABLE COMPOSITION FACTORS CAI HENG LI AND BINZHOU XIA Abstract. This paper classifies the factorizations of almost simple groups with a factor having at least two nonsolvable composition factors. This togeth...	4
Accepted by VLDB 2018 Model-Free Control for Distributed Stream Data Processing using Deep Reinforcement Learning Teng Li, Zhiyuan Xu, Jian Tang and Yanzhi Wang {tli01, zxu105, jtang02, ywang393}@syr.edu arXiv:1803.01016v1 [cs.DC] 2 Mar 2018 Department of Electrical Engineering and Computer Science Syracuse Universi...	2
УДК 004.9:66.013.512 В.В. Мигунов, Р.Р. Кафиятуллов ЗАЩИТА ИНФОРМАЦИИ В КОМПЛЕКСНОЙ САПР РЕКОНСТРУКЦИИ ПРОМЫШЛЕННЫХ ПРЕДПРИЯТИЙ Введение. По мере перехода к электронному представлению информации, которое делает возможным ее хранение и транспортировку на все более компактных носителях и передачу со все большими скоростя...	5
AptaTRACE: Elucidating Sequence-Structure Binding Motifs by Uncovering Selection Trends in HT-SELEX Experiments Phuong Dao1,? , Jan Hoinka1,? , Yijie Wang1 , Mayumi Takahashi2 , Jiehua Zhou2 , Fabrizio Costa3 , John Rossi2 , John Burnett2 , Rolf Backofen3 , and Teresa M.Przytycka1 arXiv:1604.03081v1 [q-bio.QM] 5 Apr 2...	5
arXiv:1602.08268v1 [q-bio.PE] 26 Feb 2016 Construction of Gene and Species Trees from Sequence Data incl. Orthologs, Paralogs, and Xenologs Marc Hellmuth University of Greifswald Department of Mathematics and Computer Science Walther- Rathenau-Strasse 47, D-17487 Greifswald, Germany, and Saarland University Center for...	8
3D Face Reconstruction from Light Field Images: A Model-free Approach Mingtao Feng 1,2 Syed Zulqarnain Gilani1 Yaonan Wang 2 Ajmal Mian1 1 School of Computer Science and Software Engineering, The University of Western Australia arXiv:1711.05953v3 [cs.CV] 12 Jan 2018 {zulqarnain.gilani,ajmal.mian}@uwa.edu.au 2 Colleg...	1
Group Decision Simulation 1 Evolutionary perspectives on collective decision making: Studying the implications of diversity and social network structure with agent-based simulations Hiroki Sayama Collective Dynamics of Complex Systems Research Group Departments of Bioengineering & Systems Science and Industrial Enginee...	9
Combinatorial Secretary Problems with Ordinal Information∗ Martin Hoefer† Bojana Kodric‡ arXiv:1702.01290v3 [cs.DS] 25 Aug 2017 Abstract The secretary problem is a classic model for online decision making. Recently, combinatorial extensions such as matroid or matching secretary problems have become an important tool...	8
arXiv:0908.3650v1 [cs.PL] 25 Aug 2009 Lazy mixin modules and disciplined effects Keiko Nakata February 27, 2018 Abstract Programming languages are expected to support programmer’s effort to structure program code. The ML module system, object systems and mixins are good examples of language constructs promoting modula...	6
On the Transformation Capability of Feasible Mechanisms for Programmable Matter Othon Michail1 , George Skretas2 , and Paul G. Spirakis3 1 2 arXiv:1703.04381v1 [cs.DS] 13 Mar 2017 3 Department of Computer Science, University of Liverpool, UK Othon.Michail@liverpool.ac.uk Computer Engineering and Informatics Departme...	8
arXiv:1710.01368v1 [math.AG] 3 Oct 2017 PAVAGE DE VORONOÏ ASSOCIÉ AU GROUPE DE CREMONA ANNE LONJOU Résumé. L’action du groupe de Cremona de rang 2 sur un espace hyperbolique de dimension infinie est récemment devenue centrale dans l’étude de ce groupe. Guidée par l’analogie avec l’action de PSL(2, Z) sur le demi-plan...	4
arXiv:1402.3488v2 [cs.DS] 17 Sep 2015 A Unifying Model for Representing Time-Varying Graphs Klaus Wehmuth National Laboratory for Scientific Computing (LNCC) Av. Getúlio Vargas, 333 25651-075 – Petrópolis, RJ – Brazil klaus@lncc.br Eric Fleury ENS de Lyon / INRIA – Université de Lyon UMR CNRS – ENS Lyon – UCB Lyon ...	8
A co-located partitions strategy for parallel CFD–DEM couplings Gabriele Pozzetti, Xavier Besseron, Alban Rousset, Bernhard Petersa,∗ a Campus Belval, Université du Luxembourg 6, Avenue de la Fonte, L-4364 Esch-sur-Alzette Luxembourg arXiv:1802.05029v1 [cs.CE] 14 Feb 2018 Abstract In this work, a new partition-coll...	5
arXiv:1702.07448v3 [math.ST] 30 Nov 2017 Optimal Bayesian Minimax Rates for Unconstrained Large Covariance Matrices Kyoungjae Lee1 and Jaeyong Lee2 1 Department of Applied and Computational Mathematics and Statistics, The University of Notre Dame 2 Department of Statistics, Seoul National University December 4, 201...	10
The Complex Negotiation Dialogue Game Romain Laroche Microsoft Maluuba, Montréal, Canada romain.laroche@microsoft.com arXiv:1707.01450v1 [cs.AI] 5 Jul 2017 Abstract This position paper formalises an abstract model for complex negotiation dialogue. This model is to be used for the benchmark of optimisation algorithms...	2
arXiv:1503.00374v2 [cs.DS] 31 Aug 2016 A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix Christos Boutsidis ∗ Petros Drineas † Eugenia-Maria Kontopoulou § Prabhanjan Kambadur ‡ Anastasios Zouzias ¶ Abstract We introduce a novel algorithm for approximating the loga...	8
Nonfractional Memory: Filtering, Antipersistence, and Forecasting J. Eduardo Vera-Valdés∗ Department of Mathematical Sciences, Aalborg University, and CREATES. arXiv:1801.06677v1 [math.ST] 20 Jan 2018 Abstract The fractional difference operator remains to be the most popular mechanism to generate long memory due to ...	10
IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES 1 Learning to Play Othello with Deep Neural Networks arXiv:1711.06583v1 [cs.AI] 17 Nov 2017 Paweł Liskowski, Wojciech Jaśkowski, Krzysztof Krawiec Abstract—Achieving superhuman playing level by AlphaGo corroborated the capabilities of convolutional n...	1
For a study of definable representations of algebraic groups Adrien Deloro arXiv:1510.06302v2 [math.LO] 4 Mar 2016 7th March 2016 Abstract We classify irreducible SL2 (K)-modules of low Morley rank (≤ 4 rk K) as a first step towards a more general conjecture. 1 Introduction It was more than fifty years since Robe...	4
SIMPLE DUAL BRAIDS, NONCROSSING PARTITIONS AND MIKADO BRAIDS OF TYPE Dn arXiv:1703.09599v2 [math.GR] 28 Jul 2017 BARBARA BAUMEISTER AND THOMAS GOBET Abstract. We show that the simple elements of the dual Garside structure of an Artin group of type Dn are Mikado braids, giving a positive answer to a conjecture of Dig...	4
Local Parametric Estimation in High Frequency Data∗ arXiv:1603.05700v3 [q-fin.ST] 10 Mar 2017 Yoann Potiron and Per Mykland* ** Faculty of Business and Commerce, Keio University. 2-15-45 Mita, Minato-ku, Tokyo, 108-8345, Japan. Phone: +81 3 5418 6571. Email: potiron@fbc.keio.ac.jp, website: http://www.fbc.keio.ac...	10
Improving Max-Sum through Decimation to Solve Loopy Distributed Constraint Optimization Problems J. Cerquides1 , R. Emonet2 , G. Picard3 , and J.A. Rodriquez-Aguilar1 arXiv:1706.02209v1 [cs.MA] 7 Jun 2017 1 IIIA-CSIC, Campus UAB, 08193 Cerdanyola, Catalonia, Spain {cerquide,jar}@iiia.csic.es 2 Université de Lyon, La...	2
arXiv:1410.5170v3 [math.ST] 1 Jul 2016 Robust and Efficient Parameter Estimation based on Censored Data with Stochastic Covariates Abhik Ghosh and Ayanendranath Basu Indian Statistical Institute abhianik@gmail.com, ayanbasu@isical.ac.in Abstract Analysis of random censored life-time data along with some related stoch...	10
1 Pattern Recognition Letters journal homepage: www.elsevier.com Video Semantic Object Segmentation by Self-Adaptation of DCNN Seong-Jin Park∗∗, Ki-Sang Hong arXiv:1711.08180v1 [cs.CV] 22 Nov 2017 Department of Electrical Engineering, POSTECH, Namgu Pohang, Republic Korea ABSTRACT This paper proposes a new framew...	1
Sufficient Markov Decision Processes with Alternating Deep Neural Networks Longshaokan Wang1 , Eric B. Laber1 , Katie Witkiewitz2 1 Department 2 Department of Statistics, North Carolina State University, Raleigh, NC, 27695, U.S.A. of Psychology, University of New Mexico, Albuquerque, NM, 87106, U.S.A. arXiv:1704.0753...	10
A TRACTABLE FAULT DETECTION AND ISOLATION APPROACH FOR NONLINEAR SYSTEMS WITH PROBABILISTIC PERFORMANCE arXiv:1408.1767v2 [math.OC] 22 Jan 2016 PEYMAN MOHAJERIN ESFAHANI AND JOHN LYGEROS Abstract. This article presents a novel perspective along with a scalable methodology to design a fault detection and isolation (F...	3
1 Secure Group Testing arXiv:1607.04849v3 [cs.IT] 16 Jan 2018 Alejandro Cohen Asaf Cohen Abstract—The principal goal of Group Testing (GT) is to identify a small subset of “defective” items from a large population, by grouping items into as few test pools as possible. The test outcome of a pool is positive if it c...	7
1 Random Ensembles of Lattices from Generalized Reductions arXiv:1702.00608v3 [cs.IT] 5 Feb 2018 Antonio Campello, Member, IEEE Abstract—We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constr...	7
Twenty (simple) questions arXiv:1611.01655v3 [cs.DM] 25 Apr 2017 Yuval Dagan, Yuval Filmus, Ariel Gabizon, and Shay Moran April 26, 2017 Abstract A basic combinatorial interpretation of Shannon’s entropy function is via the “20 questions” game. This cooperative game is played by two players, Alice and Bob: Alice pic...	8
arXiv:1801.08267v1 [cs.CV] 25 Jan 2018 Visual Weather Temperature Prediction Wei-Ta Chu National Chung Cheng University Kai-Chia Ho National Chung Cheng University wtchu@ccu.edu.tw kevinho627627@gmail.com Ali Borji Center for Research in Computer Vision, University of Central Florida aborji@crcv.ucf.edu Abstract ...	1
Higher-Order Program Verification via HFL Model Checking arXiv:1710.08614v2 [cs.PL] 28 Feb 2018 Naoki Kobayashi, Takeshi Tsukada, and Keiichi Watanabe The University of Tokyo Abstract. There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has ...	6
Hybrid models of the cell cycle molecular machinery Vincent Noel IRMAR UMR 6625, University of Rennes 1, Rennes, France Dima Grigoriev CNRS, Mathématiques, Université de Lille, 59655, Villeneuve d’Ascq, France Sergei Vakulenko Saint Petersburg State University of Technology and Design, St.Petersburg, Russia Ovidiu...	5
A Small-Order-Polynomial-Sized Linear Program for Solving the Traveling Salesman Problem Moustapha Diaby OPIM Department; University of Connecticut; Storrs, CT 06268 moustapha.diaby@business.uconn.edu arXiv:1610.00353v2 [cs.DS] 4 Oct 2016 Mark H. Karwan Department of Industrial and Systems Engineering; SUNY at Buffal...	8
Maximizing the Weighted Number of Spanning Trees: arXiv:1604.01116v2 [cs.DS] 12 Apr 2016 Near-t-Optimal Graphs∗ Kasra Khosoussi† Gaurav S. Sukhatme‡ Shoudong Huang† Gamini Dissanayake† March 12, 2018 Abstract Designing well-connected graphs is a fundamental problem that frequently arises in various contexts acro...	8
arXiv:1604.07736v1 [math.GR] 26 Apr 2016 BOUNDARY ACTION OF AUTOMATON GROUPS WITHOUT SINGULAR POINTS AND WANG TILINGS DANIELE D’ANGELI, THIBAULT GODIN, INES KLIMANN, MATTHIEU PICANTIN, AND EMANUELE RODARO Abstract. We study automaton groups without singular points, that is, points in the boundary for which the map th...	4
Packrat Parsing: Simple, Powerful, Lazy, Linear Time Functional Pearl Bryan Ford arXiv:cs/0603077v1 [cs.DS] 18 Mar 2006 Massachusetts Institute of Technology Cambridge, MA baford@lcs.mit.edu Abstract 1 Introduction Packrat parsing is a novel technique for implementing parsers in a lazy functional programming lang...	6
Lambda-lifting and CPS conversion in an imperative language Gabriel Kerneis Juliusz Chroboczek Université Paris Diderot, PPS, Paris, France arXiv:1202.3247v1 [cs.PL] 15 Feb 2012 February 2012 Abstract This paper is a companion technical report to the article “Continuation-Passing C: from threads to events through co...	6
Analyzing Adaptive Cache Replacement Strategies Mario E. Consuegra2 , Wendy A. Martinez1 , Giri Narasimhan1 , Raju Rangaswami1 , Leo Shao1 , and Giuseppe Vietri1 arXiv:1503.07624v2 [cs.DS] 24 Apr 2017 1 School of Computing and Information Sciences, Florida International University, Miami, FL 33199, USA. {walem001,gi...	8
arXiv:1712.01542v1 [math.RA] 5 Dec 2017 CAPABLE LIE ALGEBRAS WITH THE DERIVED SUBALGEBRA OF DIMENSION TWO OVER AN ARBITRARY FIELD PEYMAN NIROOMAND, FARANGIS JOHARI, AND MOHSEN PARVIZI Abstract. In this paper, we classify all capable nilpotent Lie algebras with the derived subalgebra of dimension 2 over an arbitrary fi...	0
arXiv:1701.07097v1 [math.RT] 24 Jan 2017 THE BRAUER TREES OF UNIPOTENT BLOCKS DAVID A. CRAVEN, OLIVIER DUDAS, AND RAPHAËL ROUQUIER Abstract. In this paper we complete the determination of the Brauer trees of unipotent blocks (with cyclic defect groups) of finite groups of Lie type. These trees were conjectured by the ...	4
Short-term Predictable Power of a Wind Farm via Distributed Control of Wind Generators with Integrated Storage arXiv:1602.04261v1 [cs.SY] 12 Feb 2016 Stefanos Baros1 Abstract— In this paper we introduce a Leader-follower consensus protocol and study its stability properties with and without communication delays. On t...	3
Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering∗ Fedor V. Fomin† Daniel Lokshtanov‡ arXiv:1604.05999v1 [cs.DS] 20 Apr 2016 Michal Pilipczukk Dániel Marx§ Marcin Pilipczuk¶ Saket Saurabh∗∗ Abstract We prove the following theorem. Given a planar gra...	8
Training a Fully Convolutional Neural Network to Route Integrated Circuits Kye Okabe † Stanford University arXiv:1706.08948v2 [cs.CV] 11 Sep 2017 Sambhav R. Jain ∗ † Oracle America Abstract We present a deep, fully convolutional neural network that learns to route a circuit layout ‘net’ with appropriate choice of me...	1
A Recurrent Neural Model with Attention for the Recognition of Chinese Implicit Discourse Relations Samuel Rönnqvist1,2,∗ , Niko Schenk2,∗ and Christian Chiarcos2 1 Turku Centre for Computer Science – TUCS, Åbo Akademi University, Turku, Finland 2 Applied Computational Linguistics Lab, Goethe University, Frankfurt am...	2
arXiv:1708.06407v1 [math.GN] 21 Aug 2017 The minimizing vector theorem in symmetrized max-plus algebra Cenap Özel Artur Piękosz Eliza Wajch Hanifa Zekraoui Department of Mathematics, King Abdulaziz University, Jeddah, Kingdom of Saudi Arabia Institute of Mathematics, Cracow University of Technology, Cracow, Poland De...	0
MR image reconstruction using deep density priors Kerem C. Tezcan1,† , Christian F. Baumgartner1 , Ender Konukoglu1 , for the Alzheimers Disease Neuroimaging Initiative∗ arXiv:1711.11386v3 [cs.CV] 17 Jan 2018 1 Computer Vision Laboratory, ETH Zürich † tezcan@vision.ee.ethz.ch December, 2017 Abstract Purpose: MR im...	1
Ristretto: Hardware-Oriented Approximation of Convolutional Neural Networks By arXiv:1605.06402v1 [cs.CV] 20 May 2016 Philipp Matthias Gysel B.S. (Bern University of Applied Sciences, Switzerland) 2012 Thesis Submitted in partial satisfaction of the requirements for the degree of Master of Science in Electrical and C...	9
Computing Maximum Flow with Augmenting Electrical Flows arXiv:1608.06016v1 [cs.DS] 21 Aug 2016 Aleksander Mądry∗ MIT madry@mit.edu Abstract 10 1 e m 7 U 7 -time algorithm for the maximum s-t ﬂow problem (and the We present an O minimum s-t cut problem) in directed with m arcs and largest integer capacity U . T...	8
Function-Specific Mixing Times and Concentration Away from Equilibrium Maxim Rabinovich, Aaditya Ramdas Michael I. Jordan, Martin J. Wainwright {rabinovich,aramdas,jordan,wainwrig}@berkeley.edu University of California, Berkeley arXiv:1605.02077v2 [math.ST] 30 Sep 2016 October 4, 2016 Abstract Slow mixing is the cen...	10
ApproxDBN: Approximate Computing for Discriminative Deep Belief Networks Xiaojing Xu, Srinjoy Das, and Ken Kreutz-Delgado arXiv:1704.03993v3 [cs.NE] 6 May 2017 Electrical and Computer Engineering, UC San Diego Xiaojing Xu and Srinjoy Das have contributed equally to this work. Abstract. Probabilistic generative neura...	9
arXiv:1608.03090v1 [cs.SY] 10 Aug 2016 Regression Models for Output Prediction of Thermal Dynamics in Buildings∗ Georgios C. Chasparis† Software Competence Center Hagenberg GmbH Department of Data Analysis Systems Softwarepark 21 4232 Hagenberg, Austria Email: georgios.chasparis@scch.at Thomas Natschlaeger Software Co...	3
arXiv:1605.09181v2 [q-fin.PM] 25 Aug 2016 The use of the multi-cumulant tensor analysis for the algorithmic optimisation of investment portfolios. † Krzysztof Domino kdomino@iitis.pl † Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, Gliwice, Poland August 26, 2016 Abstract The cumulant...	5
arXiv:1606.08970v3 [math.GR] 21 Feb 2018 THE ROTATING NORMAL FORM OF BRAIDS IS REGULAR JEAN FROMENTIN Abstract. Defined on Birman–Ko–Lee monoids, the rotating normal form has strong connections with the Dehornoy’s braid ordering. It can be seen as a process for selecting between all the representative words of a Birm...	4
SalNet360: Saliency Maps for omni-directional images with CNN Rafael Monroy∗ , Sebastian Lutz∗ , Tejo Chalasani∗ , Aljosa Smolic arXiv:1709.06505v1 [cs.CV] 19 Sep 2017 {monroyrr,lutzs,chalasat,smolica}@scss.tcd.ie Trinity College Dublin, Ireland Abstract The prediction of Visual Attention data from any kind of media...	1
D-MODULES, BERNSTEIN-SATO POLYNOMIALS AND F -INVARIANTS OF DIRECT SUMMANDS arXiv:1611.04412v1 [math.AC] 14 Nov 2016 JOSEP ÀLVAREZ MONTANER1 , CRAIG HUNEKE2 , AND LUIS NÚÑEZ-BETANCOURT3 Abstract. We study the structure of D-modules over a ring R which is a direct summand of a polynomial or a power series ring S with ...	0
arXiv:1611.10093v1 [math.GR] 30 Nov 2016 On products of groups with abelian subgroups of small index Bernhard Amberg and Yaroslav Sysak∗ Abstract It is proved that every group of the form G = AB with two subgroups A and B each of which is either abelian or has a quasicyclic subgroup of index 2 is soluble of derived l...	4
A Deep Q-Learning Agent for the L-Game with Variable Batch Training Petros Giannakopoulos and Yannis Cotronis National and Kapodistrian University of Athens - Dept of Informatics and Telecommunications Ilisia, 15784 - Greece Abstract. We employ the Deep Q-Learning algorithm with Experience Replay to train an agent capa...	2
A study on the combined interplay between stochastic fluctuations and the number of flagella in bacterial chemotaxis Daniela Besozzia Paolo Cazzanigab Matteo Dugoa Dario Pescinib Giancarlo Maurib a Università degli Studi di Milano Dipartimento di Informatica e Comunicazione Via Comelico 39, 20135 Milano, Italy besozzi...	5
Empirical Evaluation of Abstract Argumentation: Supporting the Need for Bipolar and Probabilistic Approaches Sylwia Polberg and Anthony Hunter∗ arXiv:1707.09324v2 [cs.AI] 8 Dec 2017 University College London, Department of Computer Science 66-72 Gower Street, London WC1E, United Kingdom Abstract In dialogical argume...	2
arXiv:1507.05272v1 [cs.CE] 19 Jul 2015 Under consideration for publication in Theory and Practice of Logic Programming 1 Optimizing Phylogenetic Supertrees Using Answer Set Programming LAURA KOPONEN and EMILIA OIKARINEN and TOMI JANHUNEN HIIT and Department of Computer Science Aalto University P.O. Box 15400, FI-000...	5
Planning with Information-Processing Constraints and Model Uncertainty in Markov Decision Processes Jordi Grau-Moya1,2,3 , Felix Leibfried1,2,3 , Tim Genewein1,2,3 , and Daniel A. Braun1,2 1 arXiv:1604.02080v1 [cs.AI] 7 Apr 2016 2 Max Planck Institute for Intelligent Systems, Tübingen, Germany, jordi.grau@tuebingen...	3
arXiv:1702.05641v1 [math.ST] 18 Feb 2017 On discrimination between two close distribution tails. Rodionov I. V.∗ March 17, 2018 1 Introduction. Main result. Statistics deals often with discrimination of close distributions based on censored or truncated data, in particular, for high-risk insurances and reliability ...	10
SideEye: A Generative Neural Network Based Simulator of Human Peripheral Vision arXiv:1706.04568v2 [cs.NE] 23 Oct 2017 Lex Fridman MIT Bryan Reimer MIT Benedikt Jenik MIT Christoph Zetzsche University of Bremen (a) Looking at the GPS navigation screen in the center stack. Shaiyan Keshvari MIT Ruth Rosenholtz MIT ...	1
Finding Multiple New Optimal Locations in a Road Network Ruifeng Liu Ada Wai-Chee Fu Zitong Chen The Chinese University of Hong Kong The Chinese University of Hong Kong The Chinese University of Hong Kong arXiv:1606.01340v2 [cs.DB] 14 Jun 2016 rfliu@cse.cuhk.edu.hk adafu@cse.cuhk.edu.hk ztchen@cse.cuhk.edu.hk Si...	8
arXiv:1501.05971v3 [cs.DS] 13 Dec 2015 Cooperative Greedy Pursuit Strategies for Sparse Signal Representation by Partitioning Laura Rebollo-Neira Mathematics Department Aston University B3 7ET, Birmingham, UK March 1, 2018 Abstract Cooperative Greedy Pursuit Strategies are considered for approximating a signal partiti...	8
1 Wirelessly Powered Crowd Sensing: Joint Power Transfer, Sensing, Compression, and Transmission Xiaoyang Li, Changsheng You, Sergey Andreev, Yi Gong, and Kaibin Huang arXiv:1711.02066v2 [cs.IT] 5 Mar 2018 System operation Abstract—Leveraging massive numbers of sensors in user equipment as well as opportunistic hum...	7
On Asymptotic Inference in Stochastic Differential Equations with Time-Varying Covariates Trisha Maitra and Sourabh Bhattacharya∗ Abstract arXiv:1605.03330v2 [math.ST] 13 Oct 2017 In this article, we introduce a system of stochastic differential equations (SDEs) consisting of time-dependent covariates and consider bo...	10

Subsets and Splits

No community queries yet

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