Split (3)

train · 27.2k rows

text stringlengths 2.85k 2.55M	label int64 0 10
Kullback-Leibler Divergence for the Normal-Gamma Distribution Joram Soch1,3,• & Carsten Allefeld1,2 1 2 arXiv:1611.01437v1 [math.ST] 4 Nov 2016 3 Bernstein Center for Computational Neuroscience, Berlin, Germany Berlin Center for Advanced Neuroimaging, Berlin, Germany Department of Psychology, Humboldt-Universität z...	10
Color and Shape Content Based Image Classification using RBF Network and PSO Technique: A Survey Abhishek Pandey Prof. Anjna Jayant Deen Dr. Rajeev Pandey Dept. of CSE UIT-RGPV Bhopal, India Dept. of CSE UIT-RGPV Bhopal , India anjnadeen@yahoo.com Dept. of CSE UIT-RGPV Bhopal , India rajeev98iet@gmail.com pandeya...	9
Greedy Variance Estimation for the LASSO arXiv:1803.10878v1 [math.ST] 28 Mar 2018 Christopher Kennedy∗ and Rachel Ward† Department of Mathematics, University of Texas at Austin March 30, 2018 Abstract Recent results have proven the minimax optimality of LASSO and related algorithms for noisy linear regression. Howev...	10
1 Memory-Based Data-Driven MRAC Architecture Ensuring Parameter Convergence arXiv:1602.00482v1 [cs.SY] 1 Feb 2016 Sayan Basu Roy, Shubhendu Bhasin, Indra Narayan Kar Abstract—Convergence of controller parameters in standard model reference adaptive control (MRAC) requires the system states to be persistently exciti...	3
arXiv:1407.4917v1 [cs.SE] 18 Jul 2014 Sliced Slices: Separating Data and Control Influences Shrawan Kumar Amitabha Sanyal Uday P. Khedker Tata Research Design and Development Centre Tata Consultancy Services Ltd, Pune, India Email: shrawan.kumar@tcs.com Department of Computer Science and Engineering Indian Institu...	6
OPTIMIZING SYNCHRONIZATION ALGORITHM FOR AUTO-PARALLELIZING COMPILER arXiv:1211.4101v3 [cs.DC] 1 Mar 2013 Gang Liao, Si-hui Qin, Long-fei Ma, Qi Sun Department of Computer Science and Engineering, Sichuan University Jinjiang College, China, Pengshan, 620860. greenhat1016@gmail.com, zhihuiqindoris@gmail.com, fly3601@g...	6
1 Time-Division Transmission is Optimal for Covert Communication over Broadcast Channels arXiv:1710.09754v1 [cs.IT] 26 Oct 2017 Vincent Y. F. Tan† and Si-Hyeon Lee‡ Abstract—We consider a covert communication scenario where a legitimate transmitter wishes to communicate simultaneously to two legitimate receivers wh...	7
This is a post-print of the original paper published in Pattern Recognition Letters DOI:10.1016/j.patrec.2017.10.024. Facial Attributes: Accuracy and Adversarial Robustness Andras Rozsa∗∗, Manuel Günther, Ethan M. Rudd, Terrance E. Boult arXiv:1801.02480v1 [cs.CV] 4 Jan 2018 University of Colorado Colorado Springs,...	1
AFIF4 : Deep Gender Classification based on AdaBoost-based Fusion of Isolated Facial Features and Foggy Faces arXiv:1706.04277v5 [cs.CV] 18 Nov 2017 Mahmoud Afifia,b , Abdelrahman Abdelhameda,b,∗∗ a Department of Electrical Engineering and Computer Science, Lassonde School of Engineering, York University, Canada b F...	1
A SHARP THRESHOLD FOR COLLAPSE OF THE RANDOM TRIANGULAR GROUP arXiv:1403.3516v2 [math.GR] 18 Nov 2016 SYLWIA ANTONIUK, EHUD FRIEDGUT, AND TOMASZ LUCZAK Abstract. The random triangular group Γ(n, p) is the group given by a random group presentation with n generators in which every relator of length three is present in...	4
Improved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution Carlo Condo, Furkan Ercan, Warren J. Gross arXiv:1711.11096v2 [cs.IT] 23 Jan 2018 Department of Electrical and Computer Engineering, McGill University, Montréal, Québec, Canada Email: carlo.condo@mcgill.ca, furkan.ercan@mail.m...	7
arXiv:1306.3617v6 [physics.gen-ph] 26 Dec 2015 TOPOLOGY OF THE STANDARD MODEL I: FERMIONS Steve Gersten Abstract. The Harari-Shupe model for fermions is extended to a topological model which contains an explanation for the observed fact that there are only three generations of fermions. Topological explanations are g...	4
Scalable Secure Computation of Statistical Functions with Applications to k-Nearest Neighbors Hayim Shaul, Dan Feldman, Daniela Rus arXiv:1801.07301v1 [cs.DS] 22 Jan 2018 January 24, 2018 Abstract Given a set S of n d-dimensional points, the k-nearest neighbors (KNN) is the problem of quickly finding k points in S th...	8
arXiv:1711.01085v1 [cs.DS] 3 Nov 2017 k-server via multiscale entropic regularization Sebastien Bubeck Michael B. Cohen James R. Lee Microsoft Research MIT University of Washington Yin Tat Lee Aleksander Madry ˛ University of Washington MIT Abstract We present an O((log k)2 )-competitive randomized algorithm...	8
arXiv:1401.5439v1 [math.AP] 21 Jan 2014 Formal Solutions of a Class of Pfaffian Systems in Two Variables∗ Moulay Barkatou, Suzy S. Maddah XLIM UMR 7252 ; DMI University of Limoges; CNRS 123, Avenue Albert Thomas 87060 Limoges, France moulay.barkatou@unilim.fr suzy.maddah@etu.unilim.fr † Hassan Abbas Laboratory of Ma...	0
Inverse Classification for Comparison-based Interpretability in Machine Learning Thibault Laugel1 , Marie-Jeanne Lesot1 , Christophe Marsala1 , Xavier Renard2 , Marcin Detyniecki1,2,3 arXiv:1712.08443v1 [stat.ML] 22 Dec 2017 1 Sorbonne Universitı̈¿œs, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606, 4 place Jussieu 75005 Pa...	2
Segler et al. RESEARCH Generating Focussed Molecule Libraries for Drug Discovery with Recurrent Neural Networks arXiv:1701.01329v1 [cs.NE] 5 Jan 2017 Marwin HS Segler1* , Thierry Kogej2 , Christian Tyrchan3 and Mark P Waller4 Abstract In de novo drug design, computational strategies are used to generate novel molec...	9
Fast Algorithm for Finding Maximum Distance with Space Subdivision in E2 Vaclav Skala1, Zuzana Majdisova1 1 Faculty of Applied Sciences, University of West Bohemia, Univerzitni 8, CZ 30614 Plzen, Czech Republic Abstract. Finding an exact maximum distance of two points in the given set is a fundamental computational p...	8
Directed multicut is W [1]-hard, even for four terminal pairs∗ Marcin Pilipczuk† Magnus Wahlström‡ arXiv:1507.02178v3 [cs.DS] 12 Feb 2018 Abstract We prove that Multicut in directed graphs, parameterized by the size of the cutset, is W [1]-hard and hence unlikely to be fixed-parameter tractable even if restricted t...	8
Information Sciences Information Sciences 00 (2014) 1–16 arXiv:1410.3744v1 [cs.CV] 14 Oct 2014 Refined Particle Swarm Intelligence Method for Abrupt Motion Tracking Mei Kuan Lim1 , Chee Seng Chan1 , Dorothy Monekosso2 and Paolo Remagnino3 1 University of Malaya, Center of Image and Signal Processing, 50603 Kuala Lum...	9
Adapting the Bron-Kerbosch Algorithm for Enumerating Maximal Cliques in Temporal Graphs∗ arXiv:1605.03871v2 [cs.DS] 2 May 2017 Anne-Sophie Himmel1 , Hendrik Molter1 , Rolf Niedermeier1 , and Manuel Sorge2 1 Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Germany, anne-sophie.himmel@campus.tu-be...	8
arXiv:1802.04607v2 [math.GR] 7 Mar 2018 A CANCELLATIVITY CRITERION FOR PRESENTED MONOIDS PATRICK DEHORNOY Abstract. We establish a new, fairly general cancellativity criterion for a presented monoid that properly extends the previously known criteria. It is based on a new version of the word transformation called fact...	4
Score estimation in the monotone single index model arXiv:1712.05593v1 [math.ST] 15 Dec 2017 Fadoua Balabdaoui Université Paris-Dauphine, PSL Research University, CNRS, CEREMADE, 75016 Paris, France and Seminar für Statistik, ETH Zürich, 8092, Zürich, Schweiz e-mail: fadoua.balabdaoui@gmail.com Piet Groeneboom D...	10
1 Mutually Uncorrelated Primers for DNA-Based Data Storage S. M. Hossein Tabatabaei Yazdi∗ , Han Mao Kiah† , Ryan Gabrys∗ and Olgica Milenkovic∗ arXiv:1709.05214v1 [cs.IT] 13 Sep 2017 ∗ ECE Department, University of Illinois, Urbana-Champaign Abstract—We introduce the notion of weakly mutually uncorrelated (WMU) s...	7
A NEW OUTLOOK ON COFINITENESS KAMRAN DIVAANI-AAZAR, HOSSEIN FARIDIAN AND MASSOUD TOUSI Abstract. Let a be an ideal of a commutative noetherian (not necessarily local) ring arXiv:1701.07716v2 [math.AC] 15 Nov 2017 R. In the case cd(a, R) ≤ 1, we show that the subcategory of a-cofinite R-modules is abelian. Using this...	0
Sync-DRAW: Automatic Video Generation using Deep Recurrent Attentive Architectures Gaurav Mittal∗ gaurav.mittal.191013@gmail.com Tanya Marwah∗ IIT Hyderabad ee13b1044@iith.ac.in Vineeth N Balasubramanian IIT Hyderabad vineethnb@iith.ac.in arXiv:1611.10314v4 [cs.CV] 21 Oct 2017 ABSTRACT This paper introduces a nov...	7
Optimal rates of estimation for multi-reference alignment Afonso S. Bandeira∗ , Philippe Rigollet† , and Jonathan Weed‡ arXiv:1702.08546v1 [math.ST] 27 Feb 2017 Courant Institute of Mathematical Sciences, New York University Massachusetts Institute of Technology Massachusetts Institute of Technology Abstract. This p...	10
> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 Online Tool Condition Monitoring Based on Parsimonious Ensemble+ Mahardhika Pratama, Member, IEEE, Eric Dimla, Member, IEEE, Edwin Lughofer, Witold Pedrycz, Fellow, IEEE, Tegoeh Tjahjowidodo  Abstract— Tool condition monitoring...	2
arXiv:1710.01612v2 [math.ST] 6 Jan 2018 Sensitivity of the Hermite rank Shuyang Bai Murad S. Taqqu University of Georgia Boston University January 9, 2018 Abstract The Hermite rank appears in limit theorems involving long memory. We show that an Hermite rank higher than one is unstable when the data is slightly p...	10
Submitted to the Annals of Statistics arXiv: 1607.01434 arXiv:1607.01434v3 [math.ST] 26 Jul 2016 RISK BOUNDS FOR HIGH-DIMENSIONAL RIDGE FUNCTION COMBINATIONS INCLUDING NEURAL NETWORKS By Jason M. Klusowski and Andrew R. Barron Yale University Let f ⋆ be a function on Rd satisfying a spectral norm condition. 1/4 For ...	10
Федеральное государственное автономное образовательное учреждение высшего профессионального образования «СИБИРСКИЙ ФЕДЕРАЛЬНЫЙ УНИВЕРСИТЕТ» arXiv:1601.07224v1 [cs.AI] 26 Jan 2016 Институт математики и фундаментальной информатики Базовая кафедра математического моделирования и процессов управления БАКАЛАВРСКАЯ РАБОТА...	6
A modal Logic for Termgraph Rewriting ⋆ Ph. Balbiani1 , R. Echahed2 , and A. Herzig1 arXiv:1003.4369v1 [cs.LO] 23 Mar 2010 1 Université de Toulouse, CNRS Institut de Recherche en Informatique de Toulouse (IRIT) 118 route de Narbonne, 31062 Toulouse Cedex 9, France {balbiani,herzig}@irit.fr 2 Laboratoire LIG Bât ...	6
A lattice in a residually non-Desarguesian Ã2-building Nicolas Radu∗ arXiv:1602.00588v3 [math.GR] 12 Oct 2016 October 12, 2016 Abstract We build a building of type Ã2 and a discrete group of automorphisms acting simply transitively on its set of vertices. The characteristic feature of this building is that its ran...	4
1 Interactive Communication for Data Exchange arXiv:1601.03617v3 [cs.IT] 11 Nov 2017 Himanshu Tyagi, Member, IEEE, Pramod Viswanath, Fellow, IEEE, and Shun Watanabe, Member, IEEE Abstract—Two parties observing correlated data seek to exchange their data using interactive communication. How many bits must they commu...	7
Blind-date Conversation Joining ∗ Luca Cesari1,2 1 Università di Pisa, Italy cesari@di.unipi.it Rosario Pugliese2 2 Università Francesco Tiezzi3 3 IMT degli Studi di Firenze, Italy luca.cesari@unifi.it Advanced Studies Lucca, Italy francesco.tiezzi@imtlucca.it rosario.pugliese@unifi.it We focus on a form of...	6
OPTIMAL RATE LIST DECODING OVER BOUNDED ALPHABETS USING ALGEBRAIC-GEOMETRIC CODES arXiv:1708.01070v1 [cs.CC] 3 Aug 2017 VENKATESAN GURUSWAMI AND CHAOPING XING Abstract. We give new constructions of two classes of algebraic code families which are efficiently list decodable with small output list size from a fraction...	7
APPLICATION OF SIGNAL ANALYSIS TO THE EMBEDDING PROBLEM OF Zk -ACTIONS arXiv:1709.00125v1 [math.DS] 1 Sep 2017 YONATAN GUTMAN, YIXIAO QIAO, MASAKI TSUKAMOTO Abstract. We study the problem of embedding arbitrary Zk -actions into the shift Zk action on the infinite dimensional cube [0, 1]D . We prove that if a Zk -ac...	7
Distributed Testing of Excluded Subgraphs Pierre Fraigniaud∗1 , Ivan Rapaport†2 , Ville Salo‡2 , and Ioan Todinca3 1 arXiv:1605.03719v1 [cs.DC] 12 May 2016 2 CNRS and University Paris Diderot, France DIM-CMM (UMI 2807 CNRS), Universidad de Chile, Chile 3 Université d’Orléans, France Abstract We study property tes...	8
FROBENIUS BETTI NUMBERS AND MODULES OF FINITE PROJECTIVE DIMENSION arXiv:1412.4266v2 [math.AC] 8 Sep 2015 ALESSANDRO DE STEFANI, CRAIG HUNEKE, AND LUIS NÚÑEZ-BETANCOURT Abstract. Let (R, m, K) be a local ring, and let M be an R-module of finite length. We study asymptotic invariants, βiF (M, R), defined by twisting...	0
Marmara Turkish Coreference Corpus and Coreference Resolution Baseline Peter Schüller, Kübra Cingilli, Ferit Tunçer, Barış Gün Sürmeli, Ayşegül Pekel, Ayşe Hande Karatay, arXiv:1706.01863v1 [cs.CL] 6 Jun 2017 Marmara University, Faculty of Engineering Istanbul, Turkey peter.schuller@marmara.edu.tr kubracingilli@gmail...	2
Quantum-enhanced reinforcement learning for finite-episode games with discrete state spaces arXiv:1708.09354v3 [quant-ph] 15 Sep 2017 Florian Neukart∗1 , David Von Dollen1 , Christian Seidel2 , and Gabriele Compostella2 1 Volkswagen Group of America 2 Volkswagen Data:Lab Abstract Quantum annealing algorithms belong...	7
Intersection types for unbind and rebind∗ Mariangiola Dezani-Ciancaglini Paola Giannini Dip. di Informatica, Univ. di Torino, Italy Dip. di Informatica, Univ. del Piemonte Orientale, Italy Elena Zucca DISI, Univ. di Genova, Italy We define a type system with intersection types for an extension of lambda-calculus w...	6
arXiv:1711.08278v1 [cs.CV] 22 Nov 2017 Neuron-level Selective Context Aggregation for Scene Segmentation Zhenhua Wang* Hebrew University of Jerusalem Fanglin Gu* Shandong University zhenhua.wang@mail.huji.ac.il gfl699468@mail.sdu.edu.cn Dani Lischinski Hebrew University of Jerusalem Daniel Cohen-Or Tel Aviv Unive...	1
arXiv:1611.07397v1 [cs.NI] 22 Nov 2016 Non-linear Barrier Coverage using Mobile Wireless Sensors Ashutosh Baheti Arobinda Gupta Dept. of Computer Sc. & Engineering Indian Institute of Technology, Kharagpur Kharagpur, WB-721302, India Email: ashutosh.baheti95@gmail.com Dept. of Computer Sc. & Engineering Indian Inst...	3
Open3D: A Modern Library for 3D Data Processing Qian-Yi Zhou Jaesik Park Intel Labs arXiv:1801.09847v1 [cs.CV] 30 Jan 2018 Abstract Vladlen Koltun ing practices. Open3D was created to address this need. It is an opensource library that supports rapid development of software that deals with 3D data. The Open3D fron...	1
Formalized Risk Assessment for Safety and Security arXiv:1709.00567v1 [cs.SY] 2 Sep 2017 Joachim Draeger Abstract The manifold interactions between safety and security aspects in embedded systems makes it plausible to handle safety and security risks in a unified way. The paper develops a corresponding risk measure i...	3
arXiv:1606.08151v1 [math.ST] 27 Jun 2016 Bernoulli 22(4), 2016, 2521–2547 DOI: 10.3150/15-BEJ736 Methods for improving estimators of truncated circular parameters KANIKA* and SOMESH KUMAR** 1 Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur-721302, West Bengal, India. E-mail: * 10ma90r0...	10
Lower Bounds for Differential Privacy from Gaussian Width Assimakis Kattis arXiv:1612.02914v1 [cs.DS] 9 Dec 2016 1,2 ∗1 and Aleksandar Nikolov †2 Department of Computer Science, University of Toronto. Abstract We study the optimal sample complexity of a given workload of linear queries under the constraints of d...	8
arXiv:1404.3790v1 [math.AC] 15 Apr 2014 n-COHERENCE AND (n, d)-PROPERTIES IN AMALGAMATED ALGEBRA ALONG AN IDEAL KARIMA ALAOUI ISMAILI AND NAJIB MAHDOU Abstract. Let f : A → B be a ring homomorphism and let J be an ideal of B. The purpose of this article is to examine the transfer of the properties of n-coherence and s...	0
1 Real-Time Residential-Side Joint Energy Storage Management and Load Scheduling with Renewable Integration arXiv:1511.08585v2 [cs.SY] 13 Apr 2016 Tianyi Li, Student Member, IEEE, and Min Dong, Senior Member, IEEE Abstract—We consider joint energy storage management and load scheduling at a residential site with int...	3
Suelen Gasparin Pontifical Catholic University of Paraná, Brazil Julien Berger Pontifical Catholic University of Paraná, Brazil Denys Dutykh arXiv:1701.07059v3 [cs.CE] 28 Mar 2017 CNRS, Université Savoie Mont Blanc, France Nathan Mendes Pontifical Catholic University of Paraná, Brazil Stable explicit schemes for ...	5
arXiv:1608.06012v1 [cs.PL] 21 Aug 2016 A Vision for Online Verification-Validation Matthew A. Hammer Bor-Yuh Evan Chang David Van Horn University of Colorado Boulder matthew.hammer@colorado.edu University of Colorado Boulder evan.chang@colorado.edu University of Maryland, College Park dvanhorn@cs.umd.edu Abstrac...	6
arXiv:1503.08080v2 [math.AC] 25 Jan 2016 ALGEBRAICALLY RIGID SIMPLICIAL COMPLEXES AND GRAPHS KLAUS ALTMANN, MINA BIGDELI, JÜRGEN HERZOG AND DANCHENG LU Abstract. We call a simplicial complex algebraically rigid if its Stanley-Reisner ring admits no nontrivial infinitesimal deformations, and call it inseparable if it ...	0
1 Decentralized Online Learning with Kernels Alec Koppel§ , Santiago Paternain? , Cédric Richard† and Alejandro Ribeiro? arXiv:1710.04062v1 [math.OC] 11 Oct 2017 Abstract We consider multi-agent stochastic optimization problems over reproducing kernel Hilbert spaces (RKHS). In this setting, a network of interconnec...	10
Simple groups, fixed point ratios and applications arXiv:1707.03564v1 [math.GR] 12 Jul 2017 Timothy C. Burness School of Mathematics, University of Bristol, Bristol BS8 1TW, United Kingdom Abstract. The study of fixed point ratios is a classical topic in permutation group theory, with a long history stretching back...	4
1 Coverage Analysis of a Vehicular Network Modeled as Cox Process Driven by Poisson Line Process arXiv:1709.08577v1 [cs.IT] 25 Sep 2017 Vishnu Vardhan Chetlur and Harpreet S. Dhillon Abstract In this paper, we consider a vehicular network in which the wireless nodes are located on a system of roads. We model the roa...	7
Submitted arXiv: 1509.07566 DETECTING SPARSE MIXTURES: RATE OF DECAY OF ERROR PROBABILITY ¶ arXiv:1509.07566v2 [cs.IT] 24 Dec 2016 By Jonathan G. Ligok , George V. Moustakides†† and Venugopal V. Veeravallik University of Illinois at Urbana-Champaignk , University of Patras†† and Rutgers University†† We study the rat...	10
Short-term Memory of Deep RNN arXiv:1802.00748v1 [cs.LG] 2 Feb 2018 Claudio Gallicchio Department of Computer Science, University of Pisa Largo Bruno Pontecorvo 3 - 56127 Pisa, Italy Abstract. The extension of deep learning towards temporal data processing is gaining an increasing research interest. In this paper we ...	2
arXiv:cs/0201011v1 [cs.PL] 16 Jan 2002 Under consideration for publication in Theory and Practice of Logic Programming 1 A Backward Analysis for Constraint Logic Programs ANDY KING University of Kent at Canterbury, Canterbury, CT2 7NF, UK. email: amk@ukc.ac.uk LUNJIN LU Oakland University, Rochester, MI 48309, USA....	6
On Using Linear Diophantine Equations to Tune the extent of Look Ahead while Hiding Decision Tree Rules Georgios Feretzakis and Dimitris Kalles and Vassilios S. Verykios School of Science and Technology, Hellenic Open University, Patras, Greece georgios.feretzakis@ac.eap.gr, kalles@eap.gr, verykios@eap.gr Abstract Thi...	2
arXiv:1608.02674v1 [cs.DC] 9 Aug 2016 Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems François Le Gall Graduate School of Informatics Kyoto University legall@i.kyoto-u.ac.jp Abstract Censor-Hillel et al. [PODC’15] recently showed how to efficiently implement ce...	8
arXiv:1711.10328v1 [cs.RO] 28 Nov 2017 Meteorology-Aware Multi-Goal Path Planning for Large-Scale Inspection Missions with Long-Endurance Solar-Powered Aircraft Philipp Oettershagen, Julian Förster, Lukas Wirth, Jacques Ambühl and Roland Siegwart Autonomous Systems Lab Swiss Federal Institute of Technology Zurich (E...	2
arXiv:1709.09723v1 [stat.ME] 27 Sep 2017 1 Estimating a Separably-Markov Random Field (SMuRF) from Binary Observations Yingzhuo Zhang1 , Noa Malem-Shinitski2 , Stephen A Allsop3 , Kay Tye3 and Demba Ba1 1 Harvard University, John A. Paulson School of Engineering and Applied Sciences. 2 Technische Universität Berlin....	5
An algebraic framework for end-to-end physical-layer network coding arXiv:1611.04226v1 [cs.IT] 14 Nov 2016 Elisa Gorla and Alberto Ravagnani∗ Institut de Mathématiques Université de Neuchâtel Emile-Argand 11, CH-2000 Neuchâtel, Switzerland Abstract We propose an algebraic setup for end-to-end physical-layer netw...	0
Ant-Inspired Density Estimation via Random Walks Cameron Musco cnmusco@mit.edu Hsin-Hao Su hsinhao@mit.edu Nancy Lynch lynch@csail.mit.edu arXiv:1603.02981v1 [cs.DC] 9 Mar 2016 Massachusetts Institute of Technology March 10, 2016 Abstract Many ant species employ distributed population density estimation in applicat...	8
Safe & Robust Reachability Analysis of Hybrid Systems Eugenio Moggi1a , Amin Farjudianb , Adam Duracz2c , Walid Taha3b arXiv:1709.05658v1 [cs.LO] 17 Sep 2017 a DIBRIS, Genova Univ., v. Dodecaneso 35, 16146 Genova, Italy, Email: moggi@unige.it University, Halmstad, Sweden, Email: name.surname@hh.se c Rice University,...	3
Visual Interpretability for Deep Learning: a Survey arXiv:1802.00614v2 [cs.CV] 7 Feb 2018 Quanshi Zhang and Song-Chun Zhu University of California, Los Angeles Abstract This paper reviews recent studies in understanding neural-network representations and learning neural networks with interpretable/disentangled middl...	1
Generative Adversarial Text to Image Synthesis arXiv:1605.05396v2 [cs.NE] 5 Jun 2016 Scott Reed, Zeynep Akata, Xinchen Yan, Lajanugen Logeswaran REEDSCOT 1 , AKATA 2 , XCYAN 1 , LLAJAN 1 Bernt Schiele, Honglak Lee SCHIELE 2 , HONGLAK 1 1 University of Michigan, Ann Arbor, MI, USA (UMICH . EDU) 2 Max Planck Institute ...	9
arXiv:1612.06499v2 [math.GR] 21 Dec 2016 Invariable generation of certain groups of piecewise linear homeomorphisms of the interval Yoshifumi Matsuda and Shigenori Matsumoto Abstract. Let P be the group of all the orientation preserving piecewise linear homeomorphisms of the interval [0, 1]. Given any a > 1, let P a ...	4
1 Linear Programming Bounds for Distributed Storage Codes Ali Tebbi† , Terence H. Chan‡ , Chi Wan Sung† arXiv:1710.04361v1 [cs.IT] 12 Oct 2017 † Department of Electronic Engineering, City University of Hong Kong Email: {ali.tebbi,albert.sung@cityu.edu.hk} ‡ Institute for Telecommunications Research, University of...	7
An accurate finite element method for the numerical solution of isothermal and incompressible flow of viscous fluid, part I: computational analysis arXiv:1709.00913v2 [cs.CE] 21 Mar 2018 B. Emek Abali ∗† Abstract Despite its numerical challenges, finite element method is used to compute viscous fluid flow. A consens...	5
Relaxed Locally Correctable Codes in Computationally Bounded Channels arXiv:1803.05652v1 [cs.DS] 15 Mar 2018 Jeremiah Blocki∗ Venkata Gandikota† Elena Grigorescu‡ Samson Zhou§ March 16, 2018 Abstract Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent res...	8
1 Semantic Web Today: From Oil Rigs to Panama Papers arXiv:1711.01518v1 [cs.AI] 5 Nov 2017 RIVINDU PERERA∗ , PARMA NAND, and BORIS BAČIĆ, Auckland University of Technology WEN-HSIN YANG, Industrial Technology Research Institute KAZUHIRO SEKI, Kobe University RADEK BURGET, Brno university of technology The next leap ...	2
1 Dynamic Connectivity Game for Adversarial Internet of Battlefield Things Systems arXiv:1708.05741v2 [cs.IT] 22 Dec 2017 Nof Abuzainab and Walid Saad, Senior Member, IEEE, Abstract—In this paper, the problem of network connectivity is studied for an adversarial Internet of Battlefield Things (IoBT) system in which ...	7
336 International Journal "Information Models and Analyses" Volume 3, Number 4, 2014 КОМПЛЕКСНЫЕ ИНСТРУМЕНТАЛЬНЫЕ СРЕДСТВА ИНЖЕНЕРИИ ОНТОЛОГИЙ Виталий Величко, Кирилл Малахов, Виталий Семенков, Александр Стрижак Аннотация: В статье представлен обзор актуальных специализированных инструментальных средств инженерии онт...	2
Anneaux à diviseurs et anneaux de Krull (une approche constructive) T. Coquand, H. Lombardi arXiv:1507.02880v3 [math.AC] 13 Dec 2017 14 décembre 2017 paru dans Communications in Algebra, 44 : 515–567, 2016 Quelques typos dans la bibliographie ont été corrigés par rapport à la version publiée. Par ailleurs on a...	0
Generation, Ranking and Unranking of Ordered Trees with Degree Bounds Mahdi Amani Abbas Nowzari-Dalini Dipartimento di Informatica Università di Pisa, Pisa, Italy. m amani@di.unipi.it School of Mathematics, Statistics, and Computer Science Colleague of Science, University of Tehran, Tehran, Iran. nowzari@ut.ac.ir ...	8
arXiv:1704.07722v1 [q-bio.MN] 25 Apr 2017 A Convex Approach to Steady State Moment Analysis for Stochastic Chemical Reactions Yuta Sakurai and Yutaka Hori∗ Abstract Model-based prediction of stochastic noise in biomolecular reactions often resorts to approximation with unknown precision. As a result, unexpected stoch...	3
arXiv:1709.02748v1 [math.AC] 8 Sep 2017 ON PRESERVATION PROPERTIES AND A SPECIAL ALGEBRAIC CHARACTERIZATION OF SOME STRONGER FORMS OF THE NOETHERIAN CONDITION DANNY ARLEN DE JESÚS GÓMEZ-RAMÍREZ, JUAN D. VÉLEZ, AND EDISSON GALLEGO Abstract. We give an elementary proof prove of the preservation of the Noetherian con...	0
arXiv:1509.05537v1 [quant-ph] 18 Sep 2015 The Transfer Function of Generic Linear Quantum Stochastic Systems Has a Pure Cascade Realization∗ Hendra I. Nurdin, Symeon Grivopoulos, and Ian R. Petersen† March 16, 2018 Abstract This paper establishes that generic linear quantum stochastic systems have a pure cascade real...	3
NUMERICAL SEMIGROUPS PROBLEM LIST arXiv:1304.6552v1 [math.AC] 24 Apr 2013 M. DELGADO, P. A. GARCÍA-SÁNCHEZ, AND J. C. ROSALES 1. Notable elements and first problems linear combination, with nonnegative integer coefficients, of a fixed set of integers with greatest A numerical semigroup is a subset of N (here commo...	0
Heavy hitters via cluster-preserving clustering Kasper Green Larsen∗ Jelani Nelson† Huy L. Nguy˜ên‡ Mikkel Thorup§. arXiv:1604.01357v1 [cs.DS] 5 Apr 2016 April 6, 2016 Abstract In the turnstile `p heavy hitters problem with parameter ε, one must maintain a highdimensional vector x ∈ Rn subject to updates of the ...	8
Go game formal revealing by Ising model Matías Alvaradoa , Arturo Yeeb, and Carlos Villarreal c a Center of Research and Advanced Studies – IPN, Department of Computer Science, Av. Instituto Politécnico Nacional 2508, San Pedro Zacatenco, 07360, Ciudad de México. b Universidad Autónoma de Sinaloa, Facultad de Inform...	2
Dyson’s spike for random Schroedinger operators and Novikov-Shubin invariants of groups arXiv:1602.06626v1 [math.PR] 22 Feb 2016 Marcin Kotowski Bálint Virág February 23, 2016 Abstract We study Schroedinger operators with random edge weights and their expected spectral measures µH near zero. We prove that the meas...	4
IEEE COMMUNICATIONS LETTERS 1 Joint Fractional Time Allocation and Beamforming for Downlink Multiuser MISO Systems arXiv:1706.01771v2 [cs.IT] 28 Aug 2017 Van-Dinh Nguyen, Hoang Duong Tuan, Trung Q. Duong, Oh-Soon Shin, and H. Vincent Poor Abstract—It is well-known that the traditional transmit beamforming at a bas...	7
arXiv:1712.08418v2 [math.GR] 8 Jan 2018 ON ELEMENTARY AMENABLE BOUNDED AUTOMATA GROUPS KATE JUSCHENKO, BENJAMIN STEINBERG, AND PHILLIP WESOLEK Abstract. There are several natural families of groups acting on rooted trees for which every member is known to be amenable. It is, however, unclear what the elementary amenab...	4
1 Bounds on Fractional Repetition Codes using Hypergraphs arXiv:1711.07631v1 [cs.IT] 21 Nov 2017 Krishna Gopal Benerjee, and Manish K Gupta, Senior Member, IEEE Abstract—In the Distributed Storage Systems (DSSs), encoded fraction of information is stored in the distributed fashion on different chunk servers. Recent...	7
Clustering via Crowdsourcing arXiv:1604.01839v1 [cs.DS] 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 ...	8
arXiv:1511.01553v2 [math.AG] 29 Dec 2017 A CHARACTERIZATION OF TWO-DIMENSIONAL RATIONAL SINGULARITIES VIA CORE OF IDEALS TOMOHIRO OKUMA, KEI-ICHI WATANABE, AND KEN-ICHI YOSHIDA Abstract. The notion of pg -ideals for normal surface singularities has been proved to be very useful. On the other hand, the core of ideals h...	0
Modelling Biochemical Operations on RNA Secondary Structures⋆ arXiv:cs/0306016v1 [cs.CE] 3 Jun 2003 Mercè Llabrés and Francesc Rosselló Dept. of Mathematics and Computer Science, Research Institute of Health Science (IUNICS), University of the Balearic Islands, 07122 Palma de Mallorca (Spain) {merce.llabres,cesc.r...	5
arXiv:1110.0895v4 [cs.CE] 2 Jul 2012 Robust inversion, dimensionality reduction, and randomized sampling Aleksandr Aravkin Michael P. Friedlander Felix J. Herrmann Tristan van Leeuwen March 1, 2012 Abstract We consider a class of inverse problems in which the forward model is the solution operator to linear ODEs or ...	5
arXiv:1210.5968v9 [cs.DS] 22 Dec 2015 A pair of universal sequence-set betting strategies Tomislav Petrović February 25, 2018 Abstract We introduce the sequence-set betting game, a generalization of An. A. Muchnik’s non-monotonic betting game [2]. Instead of successively partitioning the infinite binary strings by th...	8
Representations of language in a model of visually grounded speech signal Grzegorz Chrupała Lieke Gelderloos Tilburg University Tilburg University g.chrupala@uvt.nl l.j.gelderloos@uvt.nl arXiv:1702.01991v3 [cs.CL] 30 Jun 2017 Abstract We present a visually grounded model of speech perception which projects spoken utt...	2
1 Multi-Cell-Aware Opportunistic Random Access for Machine-Type Communications Huifa Lin, Member, IEEE, and Won-Yong Shin, Senior Member, IEEE arXiv:1708.02861v1 [cs.IT] 9 Aug 2017 Abstract Due to the difficulty of coordination in multi-cell random access, it is a practical challenge how to achieve the optimal throu...	7
arXiv:1610.02672v1 [math.GR] 9 Oct 2016 Internal and external duality in abstract polytopes Gabe Cunningham University of Massachusetts Boston and Mark Mixer Wentworth Institute of Technology October 11, 2016 Abstract We define an abstract regular polytope to be internally self-dual if its selfduality can be realized ...	4
1 Energy-Efficient Resource Allocation for Elastic Optical Networks using Convex arXiv:1705.06891v1 [cs.IT] 19 May 2017 Optimization Mohammad Hadi, Member, IEEE, and Mohammad Reza Pakravan, Member, IEEE Abstract We propose a two-stage algorithm for energy-efficient resource allocation constrained to QoS and physic...	7
Statistical physics of inference: Thresholds and algorithms Lenka Zdeborová1,∗ , and Florent Krzakala2,∗ arXiv:1511.02476v5 [cond-mat.stat-mech] 22 Jan 2018 2 1 Institut de Physique Théorique, CNRS, CEA, Université Paris-Saclay, F-91191, Gif-sur-Yvette, France Laboratoire de Physique Statistique, CNRS, PSL Univer...	8
Game Design and Analysis for Price based Demand Response: An Aggregate Game Approach arXiv:1508.02636v3 [q-fin.EC] 1 Feb 2016 Maojiao Ye, Student Member, IEEE, and Guoqiang Hu, Member, IEEE Abstract— In this paper, an aggregate game is adopted for the modeling and analysis of energy consumption control in smart grid....	3
Towards Effective Low-bitwidth Convolutional Neural Networks∗† Bohan Zhuang, Chunhua Shen, Mingkui Tan, Lingqiao Liu, Ian Reid arXiv:1711.00205v2 [cs.CV] 17 Nov 2017 Abstract This paper tackles the problem of training a deep convolutional neural network with both low-precision weights and low-bitwidth activations. Op...	1
1 Asymptotic Signal Detection Rates with 1-bit Array Measurements arXiv:1711.00739v2 [cs.IT] 20 Feb 2018 Manuel S. Stein Abstract—This work considers detecting the presence of a band-limited random radio source using an antenna array featuring a low-complexity digitization process with single-bit output resolution....	7

Subsets and Splits

No community queries yet

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