Split (3)

train · 27.2k rows

text stringlengths 2.85k 2.55M	label int64 0 10
IEEE TRANSACTIONS ON SIGNAL PROCESSING 1 Estimation and Mitigation of Channel Non-Reciprocity in Massive MIMO arXiv:1706.04626v1 [cs.IT] 14 Jun 2017 Orod Raeesi, Student Member, IEEE, Ahmet Gokceoglu, Member, IEEE, and Mikko Valkama, Senior Member, IEEE Abstract—Time-division duplex (TDD) based massive MIMO system...	7
Concept Formation and Dynamics of Repeated Inference in Deep Generative Models arXiv:1712.04195v1 [stat.ML] 12 Dec 2017 Yoshihiro Naganoa,d , Ryo Karakidab,d , Masato Okadaa,b,c,∗ a Graduate School of Frontier Sciences, The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba 277-8561, Japan b Artificial Intellige...	9
Optimal choice among a class of nonparametric estimators of the jump rate for piecewise-deterministic Markov processes arXiv:1506.07722v2 [math.ST] 23 May 2016 Romain Azaı̈s∗ and Aurélie Muller-Gueudin† Inria Nancy-Grand Est, Team BIGS, Institut Élie Cartan de Lorraine, Vandoeuvre-lès-Nancy, France Abstract A pie...	10
Classification of Major Depressive Disorder via Multi-Site Weighted LASSO Model Dajiang Zhu1, Brandalyn C. Riedel1, Neda Jahanshad1, Nynke A. Groenewold2,3, Dan J. Stein3, Ian H. Gotlib4, Matthew D. Sacchet5, Danai Dima6,7, James H. Cole8, Cynthia H.Y. Fu9, Henrik Walter10, Ilya M. Veer11, Thomas Frodl11,12, Lianne Sch...	5
A CRITERION FOR I-ADIC COMPLETENESS arXiv:1312.3908v1 [math.AC] 13 Dec 2013 PETER SCHENZEL A BSTRACT. Let I denote an ideal in a commutative Noetherian ring R. Let M be an R-module. The I-adic completion is defined by M̂ I = lim α M/I α M. Then M is called I-adic complete ←− whenever the natural homomorphism M → M̂ I...	0
Real-Time Localization and Tracking of Multiple Radio-Tagged Animals with an Autonomous UAV arXiv:1712.01491v4 [cs.SY] 14 Feb 2018 Hoa Van Nguyen, Michael Chesser, Fei Chen, S. Hamid Rezatofighi and Damith C. Ranasinghe School of Computer Science The University of Adelaide, SA 5005, Australia Email:{hoavan.nguyen,mic...	3
Moonshine: Distilling with Cheap Convolutions arXiv:1711.02613v1 [stat.ML] 7 Nov 2017 Elliot J. Crowley, Gavin Gray, Amos Storkey School of Informatics The University of Edinburgh Abstract Model distillation compresses a trained machine learning model, such as a neural network, into a smaller alternative such that i...	1
1 R. Serra et al. arXiv:1407.8508v1 [q-bio.MN] 30 Jul 2014 A stochastic model of catalytic reaction networks in protocells Roberto Serra1,2 , Alessandro Filisetti2 , Marco Villani1,2 , Alex Graudenzi3 , Chiara Damiani3,4 , and Tommaso Panini5 1 Dept. of Physics, Informatics and Mathematics, Modena and Reggio Emilia...	5
1 Adaptive Delivery in Caching Networks Seyed Ali Saberali, Hamidreza Ebrahimzadeh Saffar, Lutz Lampe, and Ian Blake arXiv:1707.09662v1 [cs.IT] 30 Jul 2017 Abstract The problem of content delivery in caching networks is investigated for scenarios where multiple users request identical files. Redundant user demands a...	7
1 A High-Gain Nonlinear Observer with Limited Gain Power arXiv:1501.04330v3 [cs.SY] 7 Oct 2016 Daniele Astolfi and Lorenzo Marconi Abstract—In this note we deal with a new observer for nonlinear systems of dimension n in canonical observability form. We follow the standard high-gain paradigm, but instead of having ...	3
arXiv:1711.06855v1 [cs.SY] 18 Nov 2017 A PROBABILISTIC CHARACTERIZATION OF RANDOM AND MALICIOUS COMMUNICATION FAILURES IN MULTI-HOP NETWORKED CONTROL A. CETINKAYA, H. ISHII, AND T. HAYAKAWA Abstract. The control problem of a linear discrete-time dynamical system over a multi-hop network is explored. The network is ass...	3
Two provably consistent divide and conquer clustering algorithms for large networks arXiv:1708.05573v1 [stat.ML] 18 Aug 2017 Soumendu Sundar Mukherjee1 , Purnamrita Sarkar2 , and Peter J. Bickel1 1 2 Department of Statistics, University of California, Berkeley Department of Statistics and Data Sciences, University ...	10
arXiv:1704.07811v1 [math.GR] 25 Apr 2017 R-triviality of some exceptional groups Maneesh Thakur Indian Statistical Institute, 7-S.J.S. Sansanwal Marg New Delhi 110016, India e-mail: maneesh.thakur@ gmail.com Abstract The main aim of this paper is to prove R-triviality for simple, simply connected 78 or E 78 , defined...	4
arXiv:1708.02740v1 [cs.LG] 9 Aug 2017 A Data Prism: Semi-Verified Learning in the Small-α Regime Michela Meister mmeister@stanford.edu Gregory Valiant valiant@stanford.edu August 10, 2017 Abstract We consider a simple model of unreliable or crowdsourced data where there is an underlying set of n binary variables, e...	7
SCUT-FBP5500‡: A Diverse Benchmark Dataset for Multi-Paradigm Facial Beauty Prediction Abstract—Facial beauty prediction (FBP) is a significant visual recognition problem to make assessment of facial attractiveness that is consistent to human perception. To tackle this problem, various data-driven models, especially s...	1
1 Degrees of Freedom of the Broadcast Channel with Hybrid CSI at Transmitter and Receivers arXiv:1709.02884v1 [cs.IT] 9 Sep 2017 Mohamed Fadel, Student Member, IEEE, and Aria Nosratinia, Fellow, IEEE Abstract In general the different links of a broadcast channel may experience different fading dynamics and, potenti...	7
arXiv:1208.3882v1 [cs.DC] 19 Aug 2012 Coordination Level Modeling and Analysis of Parallel Programs using Petri Nets Francisco Heron de Carvalho-Junior Departamento de Computação Universidade Federal do Ceará (UFC) Fortaleza, Brazil Rafael Dueire Lins Centro de Informática Universidade Federal de Pernambuco Recife...	6
P. Trinder, N. Chechina, N. Papaspyrou, K. Sagonas, S. Thompson, et al. • Scaling Reliably • 2017 arXiv:1704.07234v2 [cs.PL] 8 May 2017 Scaling Reliably: Improving the Scalability of the Erlang Distributed Actor Platform Phil Trinder, Natalia Chechina, Nikolaos Papaspyrou, Konstantinos Sagonas, Simon Thompson, Stephe...	6
Top Tips to Make Your Research Irreproducible Neil P. Chue Hong1 , Tom Crick2 , Ian P. Gent3 , Lars Kotthoff4 and Kenji Takeda5 1 arXiv:1504.00062v2 [cs.CE] 8 Apr 2015 2 Software Sustainability Institute, University of Edinburgh, UK Department of Computing & Information Systems, Cardiff Metropolitan University, UK 3...	5
RESTRICTION ESTIMATES FOR THE FREE TWO STEP NILPOTENT GROUP ON THREE GENERATORS arXiv:1704.07876v1 [math.GR] 25 Apr 2017 VALENTINA CASARINO AND PAOLO CIATTI Abstract. Let G be the free two step nilpotent Lie group on three generators and let L be a subLaplacian on it. We compute the spectral resolution of L and prove...	4
arXiv:1606.03809v3 [cs.PL] 29 Dec 2017 Why Nominal-Typing Matters in Object-Oriented Programming Moez A. AbdelGawad College of Mathematics and Econometrics, Hunan University Changsha 410082, Hunan, P.R. China Informatics Research Institute, SRTA-City New Borg ElArab, Alexandria, Egypt moez@cs.rice.edu January 1, 2018 ...	6
arXiv:1307.8162v2 [math.AC] 24 Jan 2018 STILLMAN’S QUESTION FOR EXTERIOR ALGEBRAS AND HERZOG’S CONJECTURE ON BETTI NUMBERS OF SYZYGY MODULES JASON MCCULLOUGH Abstract. Let K be a field of characteristic 0 and consider exterior algebras of finite dimensional K-vector spaces. In this short paper we exhibit principal qu...	0
Recruitment Market Trend Analysis with Sequential Latent Variable Models Chen Zhu1 , Hengshu Zhu1,2 , Hui Xiong3∗, Pengliang Ding1 , Fang Xie1 1 Baidu Inc., 2 Baidu Research-Big Data Lab, 3 Rutgers University, {zhuchen02, zhuhengshu, dingpengliang, xiefang}@baidu.com, hxiong@rutgers.edu arXiv:1712.02975v1 [cs.AI] 8 D...	2
Matrix Completion and Related Problems via Strong Duality Maria-Florina Balcan∗ Yingyu Liang† David P. Woodruff‡ Hongyang Zhang§ arXiv:1704.08683v3 [cs.DS] 19 Jan 2018 Abstract This work studies the strong duality of non-convex matrix factorization problems: we show that under certain dual conditions, these proble...	8
arXiv:1403.3148v4 [cs.SI] 15 Nov 2016 Heat Kernel Based Community Detection Kyle Kloster David F. Gleich Purdue University West Lafayette, IN Purdue University West Lafayette, IN kkloste@purdue.edu dgleich@purdue.edu ABSTRACT The heat kernel is a type of graph diffusion that, like the much-used personalized Page...	8
Modeling The Intensity Function Of Point Process Via Recurrent Neural Networks Shuai Xiao1 , Junchi Yan23 , Stephen M. Chu3 , Xiaokang Yang1 , Hongyuan Zha4 arXiv:1705.08982v1 [cs.LG] 24 May 2017 1 Shanghai Jiao Tong University 2 East China Normal University 3 IBM Research – China 4 Georgia Tech {benjaminforever,xky...	2
arXiv:1404.1957v3 [math.PR] 29 Oct 2015 The Annals of Applied Probability 2015, Vol. 25, No. 6, 3511–3570 DOI: 10.1214/14-AAP1081 c Institute of Mathematical Statistics, 2015 ERGODIC CONTROL OF MULTI-CLASS M/M/N + M QUEUES IN THE HALFIN–WHITT REGIME By Ari Arapostathis∗,1, Anup Biswas∗,2 and Guodong Pang†,3 The Unive...	3
1 Role Playing Learning for Socially Concomitant Mobile Robot Navigation arXiv:1705.10092v1 [cs.RO] 29 May 2017 Mingming Li, Rui Jiang, Shuzhi Sam Ge, Fellow, IEEE, and Tong Heng Lee, Member, IEEE Abstract—In this paper, we present the Role Playing Learning (RPL) scheme for a mobile robot to navigate socially with ...	2
arXiv:1301.2418v1 [math.AC] 11 Jan 2013 BORNES EFFECTIVES DES FONCTIONS D’APPROXIMATION DES SOLUTIONS FORMELLES D’ÉQUATIONS BINOMIALES GUILLAUME ROND Résumé. The aim of this paper is to give an effective version of the Strong Artin Approximation Theorem for binomial equations. First we give an effective version of th...	0
Estimation in the convolution structure density model. Part II: adaptation over the scale of anisotropic classes. arXiv:1704.04420v1 [math.ST] 14 Apr 2017 O.V. Lepski ∗ T. Willer ∗ Institut de Mathématique de Marseille Aix-Marseille Université 39, rue F. Joliot-Curie 13453 Marseille, France e-mail: oleg.lepski@...	10
D-OPTIMAL DESIGNS WITH ORDERED CATEGORICAL DATA arXiv:1502.05990v5 [math.ST] 8 Nov 2017 Jie Yang1 , Liping Tong2 and Abhyuday Mandal3 1 University of Illinois at Chicago, 2 Advocate Health Care and 3 University of Georgia Abstract: Cumulative link models have been widely used for ordered categorical responses. Unifo...	10
Contextual Bandits with Stochastic Experts Rajat Sen1 , Karthikeyan Shanmugam2 , and Sanjay Shakkottai1 1 arXiv:1802.08737v1 [stat.ML] 23 Feb 2018 2 The University of Texas at Austin IBM Research, Thomas J. Watson Center February 27, 2018 Abstract We consider the problem of contextual bandits with stochastic expert...	2
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000–000 S 0002-9947(XX)0000-0 arXiv:1601.08231v5 [math.RA] 22 Jan 2018 GENERALIZED NIL-COXETER ALGEBRAS OVER DISCRETE COMPLEX REFLECTION GROUPS APOORVA KHARE Abstract. We define and study generalized nil-Coxeter algebras associated to Coxet...	4
Feudal Reinforcement Learning for Dialogue Management in Large Domains Iñigo Casanueva1 , Paweł Budzianowski1 , Pei-Hao Su2 , Stefan Ultes1 , Lina Rojas-Barahona1 , Bo-Hsiang Tseng1 and Milica Gašić1 1 Department of Engineering, University of Cambridge, UK 2 PolyAI Limited, London, UK ic340@cam.ac.uk arXiv:1803.032...	2
IDENTIFICATION OF MULTI-OBJECT DYNAMICAL SYSTEMS: CONSISTENCY AND FISHER INFORMATION arXiv:1707.04371v1 [math.ST] 14 Jul 2017 JEREMIE HOUSSINEAU∗ , SUMEETPAL S. SINGH† , AND AJAY JASRA‡ Abstract. Learning the model parameters of a multi-object dynamical system from partial and perturbed observations is a challenging ...	10
1 Advanced Quantizer Designs for FDD-based FD-MIMO Systems Using Uniform Planar Arrays arXiv:1703.10739v3 [cs.IT] 3 Nov 2017 Jiho Song, Member, IEEE, Junil Choi, Member, IEEE, Taeyoung Kim, Member, IEEE, and David J. Love, Fellow, IEEE UPA structure is known as full-dimension (FD) MIMO because of its ability to exp...	7
Fast Distributed Algorithms for Testing Graph Properties Keren Censor-Hillel∗ Eldar Fischer∗ Gregory Schwartzman∗ Yadu Vasudev∗ arXiv:1602.03718v3 [cs.DC] 2 May 2016 May 3, 2016 Abstract We initiate a thorough study of distributed property testing – producing algorithms for the approximation problems of property ...	8
arXiv:1802.07995v2 [math.PR] 23 Feb 2018 Multidimensional multiscale scanning in Exponential Families: Limit theory and statistical consequences Claudia König claudia.koenig@stud.uni-goettingen.de Institute for Mathematical Stochastics, University of Göttingen Axel Munk munk@math.uni-goettingen.de Institute for Math...	10
Space-Efficient Latent Contracts Michael Greenberg arXiv:1604.02474v4 [cs.PL] 6 Jun 2017 Pomona College michael@cs.pomona.edu Abstract. Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program’s asymptotic complexity; space-efficiency restores tail recursion ...	6
On Expressing and Monitoring Oscillatory Dynamics Petr Dluhoš, Luboš Brim, and David Šafránek ∗ Faculty of Informatics Masaryk University Botanická 68a, Brno, Czech Republic safranek@fi.muni.cz To express temporal properties of dense-time real-valued signals, the Signal Temporal Logic (STL) has been defined by Ma...	5
Infinitely generated semigroups and polynomial complexity arXiv:1503.04610v2 [math.GR] 11 May 2016 J.C. Birget Abstract This paper continues the functional approach to the P-versus-NP problem, begun in [2]. Here we focus on the monoid RMP2 of right-ideal morphisms of the free monoid, that have polynomial input balanc...	4
Simple Problems The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts arXiv:1709.10377v1 [math.OC] 18 Apr 2017 Naoki Hamada Fujitsu Laboratories Ltd. 4-1-1 Kamikodanaka, Nakahara-ku Kawasaki, Japan hamada-naoki@jp.fujitsu.com ABSTRACT 1.2 Related Studies in Other Fields Quite a few studies on real-world...	9
Distributed Spanner Approximation Keren Censor-Hillel∗ Michal Dory∗ arXiv:1802.03160v1 [cs.DS] 9 Feb 2018 February 12, 2018 Abstract We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardn...	8
arXiv:1704.04782v1 [cs.DC] 16 Apr 2017 A Security Monitoring Framework For Virtualization Based HEP Infrastructures A. Gomez Ramirez1 , M. Martinez Pedreira2 , C. Grigoras2 , L. Betev2 , C. Lara1 and U. Kebschull1 for the ALICE Collaboration 1 2 Infrastructure and Computer Systems for Data Processing (IRI), Goethe-Un...	2
Can Machines Think in Radio Language? arXiv:1710.02648v3 [cs.AI] 15 December 2017 Yujian Li College of Computer Science, Beijing University of Technology, Beijing 100124, China Email: liyujian@bjut.edu.cn Abstract: People can think in auditory, visual and tactile forms of language, so can machines principally. But is...	2
1 Interpreting Deep Visual Representations via Network Dissection arXiv:1711.05611v1 [cs.CV] 15 Nov 2017 Bolei Zhou∗ , David Bau∗ , Aude Oliva, and Antonio Torralba Abstract—The success of recent deep convolutional neural networks (CNNs) depends on learning hidden representations that can summarize the important fac...	1
Semantic Photometric Bundle Adjustment on Natural Sequences Rui Zhu, Chaoyang Wang, Chen-Hsuan Lin, Ziyan Wang, Simon Lucey The Robotics Institute, Carnegie Mellon University arXiv:1712.00110v1 [cs.CV] 30 Nov 2017 {rz1, chaoyanw, chenhsul, ziyanw1}@andrew.cmu.edu, slucey@cs.cmu.edu Abstract The problem of obtaining ...	1
arXiv:1711.04969v2 [stat.ML] 22 Jan 2018 Straggler Mitigation in Distributed Optimization Through Data Encoding Can Karakus UCLA Los Angeles, CA karakus@ucla.edu Yifan Sun Technicolor Research Los Altos, CA Yifan.Sun@technicolor.com Suhas Diggavi UCLA Los Angeles, CA suhasdiggavi@ucla.edu Wotao Yin UCLA Los Angele...	7
An Effective AHP based Metaheuristic Approach to Solve Supplier Selection Problem Tamal Ghosh1, Tanmoy Chakraborty, Pranab K Dan Department of Industrial Engineering & Management, West Bengal University of Technology. BF 142, Sector 1, Salt Lake City, Kolkata 700064, India. Email: tamal.31@gmail.com, chakrabortytanmoy....	9
TRIPLE MASSEY PRODUCTS VANISH OVER ALL FIELDS arXiv:1412.7611v3 [math.NT] 23 Aug 2016 JÁN MINÁČ AND NGUYỄN DUY TÂN A BSTRACT. We show that the absolute Galois group of any field has the vanishing triple Massey product property. Several corollaries for the structure of maximal pro-p-quotient of absolute Galois groups...	4
1 Energy Storage Arbitrage in Real-Time Markets via Reinforcement Learning Hao Wang, Baosen Zhang Department of Electrical Engineering, University of Washington, Seattle, WA 98195 arXiv:1711.03127v2 [cs.SY] 23 Feb 2018 Email: {hwang16,zhangbao}@uw.edu Abstract In this paper, we derive a temporal arbitrage policy fo...	3
Interdependent Security Games on Networks under Behavioral Probability Weighting∗ arXiv:1510.09106v3 [cs.GT] 12 Aug 2016 Ashish R. Hota and Shreyas Sundaram† Abstract We consider a class of interdependent security games on networks where each node chooses a personal level of security investment. The attack probabili...	3
1 Link Selection in Hybrid RF/VLC Systems under Statistical Queueing Constraints Marwan Hammouda, Sami Akın† , Anna Maria Vegni, Harald Haas, and Jürgen arXiv:1711.08175v1 [cs.IT] 22 Nov 2017 Peissig Abstract The co-deployment of radio frequency (RF) and visible light communications (VLC) technologies has been inv...	7
Developing Bug-Free Machine Learning Systems With Formal Mathematics Daniel Selsam 1 Percy Liang 1 David L. Dill 1 arXiv:1706.08605v1 [cs.SE] 26 Jun 2017 Abstract Noisy data, non-convex objectives, model misspecification, and numerical instability can all cause undesired behaviors in machine learning systems. As a r...	2
arXiv:1512.05999v1 [math.AC] 18 Dec 2015 ON DING INJECTIVE, DING PROJECTIVE, AND DING FLAT MODULES AND COMPLEXES JAMES GILLESPIE Abstract. We characterize Ding modules and complexes over Ding-Chen rings. We show that over a Ding-Chen ring R, the Ding projective (resp. Ding injective, resp. Ding flat) R-modules coincid...	0
Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons∗ Adrian Kosowski and Laurent Viennot arXiv:1609.00512v2 [cs.DS] 12 Dec 2016 Inria Paris and IRIF, Université Paris Diderot, France Abstract The goal of a hub-based distance labeling scheme for a network G = (V, E) is to assign a small subset S(u) ...	8
Proceedings of Machine Learning Research vol 75:1–22, 2018 Minimax Distribution Estimation in Wasserstein Distance Shashank Singh SSS 1@ CS . CMU . EDU Barnabás Póczos BAPOCZOS @ CS . CMU . EDU arXiv:1802.08855v1 [math.ST] 24 Feb 2018 Machine Learning Department, Carnegie Mellon University, Pittsburgh, PA 15213...	10
Intelligent Device Discovery in the Internet of Things – Enabling the Robot Society James Sunthonlap, Phuoc Nguyen, Zilong Ye arXiv:1712.08296v2 [cs.AI] 8 Jan 2018 California State University Los Angeles 5151 State University Drive, Los Angeles, CA 90032, USA Email: zye5@calstatela.edu Abstract—The Internet of Thing...	2
SOFIC ENTROPY OF GAUSSIAN ACTIONS arXiv:1509.07835v2 [math.DS] 31 Dec 2015 BEN HAYES Abstract. Associated to any orthogonal representation of a countable discrete group is a probability measure-preserving action called the Gaussian action. Using the Polish model formalism we developed before, we compute the entropy (...	4
arXiv:1708.05761v1 [math.AC] 18 Aug 2017 EXTENDED PLUS CLOSURE IN COMPLETE LOCAL RINGS RAYMOND C HEITMANN AND LINQUAN MA Abstract. The (full) extended plus closure was developed as a replacement for tight closure in mixed characteristic rings. Here it is shown by adapting André’s perfectoid algebra techniques that, ...	0
arXiv:1711.08410v1 [math.GR] 22 Nov 2017 LATTICE ENVELOPES URI BADER, ALEX FURMAN, AND ROMAN SAUER Abstract. We introduce a class of countable groups by some abstract grouptheoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishin...	4
NEURAL NETWORK APPROACH TO RAILWAY STAND LATERAL SKEW CONTROL Peter Mark Beneš1, Matouš Cejnek1, Jan Kalivoda2 and Ivo Bukovsky1 1 Department of Instrumentation and Control Engineering, Czech Technical University, Prague, Czech Republic {PeterMark.Benes;Matous.Cejnek;Ivo.Bukovsky}@fs.cvut.cz 2 Department of Automobil...	9
Sequential Coding of Gauss–Markov Sources arXiv:1702.01779v3 [cs.IT] 3 Jun 2017 Anatoly Khina, Ashish Khisti, Victoria Kostina, and Babak Hassibi Abstract—We consider the problem of sequential transmission of Gauss–Markov sources. We show that in the limit of large spatial block lengths, greedy compression with resp...	7
Reuse of Neural Modules for General Video Game Playing Alexander Braylan Mark Hollenbeck Elliot Meyerson Risto Miikkulainen arXiv:1512.01537v1 [cs.NE] 4 Dec 2015 Department of Computer Science, The University of Texas at Austin {braylan,mhollen,ekm,risto}@cs.utexas.edu Abstract A general approach to knowledge tra...	9
arXiv:1705.04910v2 [math.GR] 23 Aug 2017 Discretization of SU(2) and the orthogonal group using icosahedral symmetries and the golden numbers Robert V. Moody & Jun Morita August 25, 2017 Department of Mathematics and Statistics, University of Victoria, Victoria, BC., V8W 3R4 Canada Department of Mathematics, Universi...	4
PREPRINT VERSION Improving files availability for BitTorrent using a diffusion model C. Napoli, G. Pappalardo, and E. Tramontana arXiv:1409.4565v1 [cs.NI] 16 Sep 2014 PUBLISHED ON: 2014 IEEE 23rd International WETICE Conference BIBITEX: @incollection{Napoli2014Improving year={2014}, isbn={978-1-4799-4249-7/14}, doi=...	9
IEEE TRANSACTIONS ON INFORMATION THEORY 1 Sum-networks from incidence structures: construction and capacity analysis arXiv:1611.01887v2 [cs.IT] 29 Jan 2018 Ardhendu Tripathy, Student Member, IEEE, and Aditya Ramamoorthy, Member, IEEE Abstract—A sum-network is an instance of a function computation problem over a di...	7
FROM ISOLATED SUBGROUPS TO GENERIC PERMUTATION REPRESENTATIONS arXiv:1601.07538v1 [math.GR] 27 Jan 2016 YAIR GLASNER, DANIEL KITROSER, AND JULIEN MELLERAY Abstract. Let G be a countable group, Sub(G) the (compact, metric) space of all subgroups of G with the Chabauty topology and Is(G) ⊆ Sub(G) the collection of isol...	4
arXiv:1802.05662v1 [cs.DS] 15 Feb 2018 List Heaps Andrew Frohmader∗ February 2018 Abstract This paper presents a simple extension of the binary heap, the List Heap. We use List Heaps to demonstrate the idea of adaptive heaps: heaps whose performance is a function of both the size of the problem instance and the disor...	8
Balancing Explicability and Explanations Emergent Behaviors in Human-Aware Planning Tathagata Chakraborti, Sarath Sreedharan, Subbarao Kambhampati∗ School of Computing, Informatics, and Decision Systems Engineering Arizona State University, Tempe, AZ 85281 USA tchakra2,ssreedh3,rao@asu.edu arXiv:1708.00543v2 [cs.AI] 3...	2
Action and perception for spatiotemporal patterns Martin Biehl1,2 and Daniel Polani 2 1 2 Araya, Tokyo, 151-0001 University of Hertfordshire, Hatfield, AL10 9AB arXiv:1706.03576v1 [cs.AI] 12 Jun 2017 martin@araya.org Abstract This is a contribution to the formalization of the concept of agents in multivariate Marko...	2
GATED RECURRENT NETWORKS FOR SEIZURE DETECTION M. Golmohammadi, S. Ziyabari, V. Shah, E. Von Weltin, C. Campbell, I. Obeid and J. Picone Neural Engineering Data Consortium, Temple University, Philadelphia, Pennsylvania, USA {meysam, saeedeh, vinitshah, eva.vonweltin, christopher.campbell, obeid, picone}@temple.edu Abst...	2
NodeTrix Planarity Testing with Small Clusters Emilio Di Giacomo1 , Giuseppe Liotta1 , Maurizio Patrignani2 , Alessandra Tappini1 arXiv:1708.09281v2 [cs.DS] 4 Sep 2017 1 Università degli Studi di Perugia, Italy {emilio.digiacomo,giuseppe.liotta}@unipg.it alessandra.tappini@studenti.unipg.it 2 Roma Tre University, I...	8
TC0 circuits for algorithmic problems in nilpotent groups Alexei Myasnikov1 and Armin Weiß2 1 2 Stevens Institute of Technology, Hoboken, NJ, USA Universität Stuttgart, Germany arXiv:1702.06616v2 [math.GR] 26 Jul 2017 Abstract Recently, Macdonald et. al. showed that many algorithmic problems for finitely generated n...	4
arXiv:1802.01730v1 [cs.MA] 5 Feb 2018 Local Wealth Redistribution Promotes Cooperation in Multiagent Systems Flávio L. Pinheiro Fernando P. Santos Collective Learning Group, The MIT Media Lab Massachusetts Institute of Technology, 22 Ames Street, Cambridge, Massachusetts flaviopp@mit.edu INESC-ID and Instituto Supe...	2
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark∗ Michael Hamann† , Ulrich Meyer‡ , Manuel Penschuck‡ , Hung Tran‡ , and Dorothea Wagner† † Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany arXiv:1604.08738v3 [cs.DS] 14 Jun 2017...	8
arXiv:1510.08568v2 [cs.NE] 8 Apr 2016 Feature-Based Diversity Optimization for Problem Instance Classification Wanru Gao Optimisation and Logistics School of Computer Science The University of Adelaide Adelaide, Australia Samadhi Nallaperuma Department of Computer Science The University of Sheffield Sheffield,UK Fra...	9
Variants of Plane Diameter Completion∗† Petr A. Golovach‡ Clment Requil§ Dimitrios M. Thilikos¶ arXiv:1509.00757v1 [cs.DS] 2 Sep 2015 Abstract The Plane Diameter Completion problem asks, given a plane graph G and a positive integer d, if it is a spanning subgraph of a plane graph H that has diameter at most d. We e...	8
A Centralized Local Algorithm for the Sparse Spanning Graph Problem Christoph Lenzen ∗ Reut Levi † arXiv:1703.05418v2 [cs.DS] 18 Jul 2017 July 20, 2017 Abstract Constructing a sparse spanning subgraph is a fundamental primitive in graph theory. In this paper, we study this problem in the Centralized Local model, ...	8
An Adaptive Sampling Scheme to Efficiently Train Fully Convolutional Networks for Semantic Segmentation Lorenz Berger1,2 , Eoin Hyde1,2 , M. Jorge Cardoso1 , and Sébastien Ourselin1 arXiv:1709.02764v4 [cs.CV] 22 Dec 2017 1 TIG, CMIC, University College London, London, UK 2 Innersight Labs, London, UK Abstract Deep...	1
arXiv:1411.4691v3 [math.ST] 8 Nov 2016 Group Regularized Estimation under Structural Hierarchy Yiyuan She, Zhifeng Wang and He Jiang Department of Statistics, Florida State University Abstract Variable selection for models including interactions between explanatory variables often needs to obey certain hierarchical c...	10
Making up for the deficit in a marathon run Iztok Fister Jr.,1 Dušan Fister,2 Suash Deb,3, 4 Uroš Mlakar,5 Janez Brest,5 and Iztok Fister5 1 University of Maribor, Faculty of Electrical Engineering and Computer Science, Smetanova 17, 2000 Maribor, Slovenia; Email: iztok.fister1@um.si 2 University of Maribor, Facul...	9
1 Hybrid Precoder and Combiner Design with Low Resolution Phase Shifters in mmWave MIMO Systems arXiv:1710.06192v1 [cs.IT] 17 Oct 2017 Zihuan Wang, Student Member, IEEE, Ming Li, Senior Member, IEEE, Qian Liu, Member, IEEE, and A. Lee Swindlehurst, Fellow, IEEE Abstract—Millimeter wave (mmWave) communications have ...	7
Phaseless compressive sensing using partial support information arXiv:1705.04048v2 [cs.IT] 13 Dec 2017 Zhiyong Zhou∗, Jun Yu Department of Mathematics and Mathematical Statistics, Umeå University, Umeå, 901 87, Sweden December 14, 2017 Abstract: We study the recovery conditions of weighted ℓ1 minimization for real...	7
Inferential results for a new measure of inequality Youri Davydova , Francesca Greselinb a Laboratoire Paul Painlevé, Université des Sciences et Technologies de Lille (Lille 1), arXiv:1706.05576v1 [math.ST] 17 Jun 2017 Lille, France and Saint Petersburg State University, Saint Petersburg, Russia b Dipartimento di...	10
1 Scalable Co-Optimization of Morphology and Control in Embodied Machines Nick Cheney1,2∗ , Josh Bongard3 , Vytas SunSpiral4 , and Hod Lipson5 Department of Computational Biology and Biological Statistics, Cornell University, Ithaca, NY 2 Department of Computer Science, University of Wyoming, Laramie, WY 3 Department ...	2
Criteria for universality of quantum gates Adam Sawicki1 and Katarzyna Karnas1∗ 1 Center for Theoretical Physics PAS, Al. Lotników 32/46, 02-668, Warsaw, Poland arXiv:1610.00547v6 [quant-ph] 17 May 2017 We consider the problem of deciding if a set of quantum one-qudit gates S = {U1 , . . . , Un } is universal. We pr...	4
Iterators, Recursors and Interaction Nets Ian Mackie1 , Jorge Sousa Pinto2 , and Miguel Vilaça2 mackie@lix.polytechnique.fr,{jsp,jmvilaca}@di.uminho.pt 1 arXiv:0910.3321v1 [cs.PL] 17 Oct 2009 2 LIX, CNRS UMR 7161, École Polytechnique, 91128 Palaiseau Cedex, France Departamento de Informática / CCTC, Universidade ...	6
Generalization without Systematicity: On the Compositional Skills of Sequence-to-Sequence Recurrent Networks Brenden Lake 1 2 Marco Baroni 2 arXiv:1711.00350v2 [cs.CL] 11 Feb 2018 Abstract Humans can understand and produce new utterances effortlessly, thanks to their compositional skills. Once a person learns the me...	2
arXiv:1604.07227v1 [math.GR] 25 Apr 2016 Alternate modules are subsymplectic Clément Guérin∗ April 26, 2016 Abstract In this paper, an alternate module (A, φ) is a finite abelian group A with a Z-bilinear application φ : A × A → Q/Z which is alternate (i.e. zero on the diagonal). We shall prove that any alternate m...	4
arXiv:1206.5112v1 [cs.PL] 22 Jun 2012 Lucretia — a type system for objects in languages with reflection∗ Viviana Bono1 , Marcin Benke2 , and Aleksy Schubert2 1 Dipartimento di Informatica dell’Università di Torino† 2 University of Warsaw‡ May 1, 2012 Abstract Object-oriented scripting languages such as JavaScript or...	6
1 arXiv:1711.09305v2 [cs.PL] 28 Nov 2017 A Language for Probabilistically Oblivious Computation DAVID DARAIS, University of Maryland CHANG LIU, University of California, Berkeley IAN SWEET, University of Maryland MICHAEL HICKS, University of Maryland An oblivious computation is one that is free of direct and indirect...	6
arXiv:0809.3187v1 [cs.CE] 18 Sep 2008 A Control Variate Approach for Improving Efficiency of Ensemble Monte Carlo ⋆ Tarik Borogovac a,b,∗ Francis J. Alexander b Pirooz Vakili c a Electrical b CCS-3, c Division and Computer Engineering Department, Boston University, 8 Saint Mary’s St. Boston, MA 02215, USA Los Alamos...	5
Threshold Selection for Multivariate Heavy-Tailed Data Phyllis Wan and Richard A. Davis arXiv:1707.00464v2 [math.ST] 26 Mar 2018 Department of Statistics Columbia University 1255 Amsterdam Avenue, MC 4690 New York, NY 10027 e-mail: phyllis@stat.columbia.edu; rdavis@stat.columbia.edu Abstract: Regular variation is oft...	10
Real group orbits on flag ind-varieties of SL(∞, C) arXiv:1601.04326v3 [math.AG] 22 Apr 2017 Mikhail V. Ignatyev, Ivan Penkov, and Joseph A. Wolf Abstract We consider the complex ind-group G = SL(∞, C) and its real forms G0 = SU(∞, ∞), SU(p, ∞), SL(∞, R), SL(∞, H). Our main object of study are the G0 -orbits on an i...	4
arXiv:1612.03492v1 [math.GR] 11 Dec 2016 Lipschitz 1-connectedness for some solvable Lie groups. David Bruce Cohen February 19, 2018 Abstract A space X is said to be Lipschitz 1-connected if every Lipschitz loop γ : S 1 Ñ X bounds a OpLippγqq-Lipschitz disk f : D2 Ñ X. A Lipschitz 1-connected space admits a quadratic...	4
Simple Cortex: A Model of Cells in the Sensory Nervous System Simple Cortex: A Model of Cells in the Sensory Nervous System David Di Giorgio neuroowl.com/ddigiorg Abstract Neuroscience research has produced many theories and computational neural models o...	2
arXiv:1704.06068v1 [math.GR] 20 Apr 2017 Coleman automorphisms of finite groups and their minimal normal subgroups Arne Van Antwerpen Abstract In this paper, we show that all Coleman automorphisms of a finite group with self-central minimal non-trivial characteristic subgroup are inner; therefore the normalizer proper...	4
1 Rate-Distortion Bounds on Bayes Risk in Supervised Learning arXiv:1605.02268v2 [cs.IT] 17 Nov 2017 Matthew Nokleby∗ , Ahmad Beirami† , Robert Calderbank‡ ∗ Wayne State University, Detroit, MI, email: matthew.nokleby@wayne.edu † MIT, Cambridge, MA, email: beirami@mit.edu ‡ Duke University, Durham, NC, email: robert...	7
Sorting with Recurrent Comparison Errors∗ Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna Department of Computer Science, ETH Zürich, Switzerland {name}.{surname}@inf.ethz.ch arXiv:1709.07249v1 [cs.DS] 21 Sep 2017 Abstract We present a sorting algorithm for the case of recurrent random comparison er...	8

Subsets and Splits

No community queries yet

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