Split (3)

train · 27.2k rows

text stringlengths 2.85k 2.55M	label int64 0 10
Finite Uniform Bisimulations for Linear Systems with Finite Input Alphabets arXiv:1510.04209v1 [math.OC] 14 Oct 2015 Donglei Fan and Danielle C. Tarraf∗ Abstract We consider a class of systems over finite alphabets, namely discrete-time systems with linear dynamics and a finite input alphabet. We formulate a notion ...	3
C ∗-algebras generated by projective representations of free nilpotent groups arXiv:1301.2942v2 [math.OA] 7 Jul 2016 Tron Ånen Omland Updated version, July 2016 Abstract We compute the two-cocycles (or multipliers) of the free nilpotent groups of class 2 and rank n and give conditions for simplicity of the correspond...	4
arXiv:1608.02085v1 [math.GR] 6 Aug 2016 AN AXIOMATIZABLE PROFINITE GROUP WITH INFINITELY MANY OPEN SUBGROUPS OF INDEX 2 OR BEN PORATH AND MARK SHUSTERMAN Abstract. We show that a profinite group with the same first-order theory as the direct product over all odd primes p of the dihedral group of order 2p, is necessari...	4
Computing All Distinct Squares in Linear Time for Integer Alphabets Hideo Bannai1 , Shunsuke Inenaga1 , and Dominik Köppl2 arXiv:1610.03421v2 [cs.DS] 20 Feb 2017 1 Department of Informatics, Kyushu University, Japan, inenaga@inf.kyushu-u.ac.jp, bannai@inf.kyushu-u.ac.jp 2 Department of Computer Science, TU Dortmund...	8
arXiv:cs/0204047v2 [cs.CE] 22 Apr 2002 Sampling Strategies for Mining in Data-Scarce Domains Chris Bailey-Kellogg Department of Computer Sciences Purdue University, IN 47907 Tel: (765) 494-9025 Email: cbk@cs.purdue.edu Naren Ramakrishnan Department of Computer Science Virginia Tech, VA 24061 Tel: (540) 231-8451 Email...	5
Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds arXiv:1605.02065v1 [cs.CR] 6 May 2016 Mark Bun∗ Thomas Steinke† {mbun,tsteinke}@seas.harvard.edu Abstract “Concentrated differential privacy” was recently introduced by Dwork and Rothblum as a relaxation of differential privacy, which ...	8
Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networks arXiv:1602.07868v3 [cs.LG] 4 Jun 2016 Tim Salimans OpenAI tim@openai.com Diederik P. Kingma OpenAI dpkingma@openai.com Abstract We present weight normalization: a reparameterization of the weight vectors in a neural net...	9
Proper affine actions in non-swinging representations arXiv:1605.03833v1 [math.GR] 12 May 2016 Ilia Smilga May 13, 2016 For a semisimple real Lie group G with an irreducible representation ρ on a finite-dimensional real vector space V , we give a sufficient criterion on ρ for existence of a group of affine transforma...	4
Approximately Counting Triangles in Sublinear Time arXiv:1504.00954v3 [cs.DS] 22 Sep 2015 Talya Eden∗ Amit Levi† Dana Ron‡ C. Seshadhri § Abstract We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algo...	8
MULTIPLICATIVE STRUCTURES OF HYPERCYCLIC FUNCTIONS FOR CONVOLUTION OPERATORS LUIS BERNAL-GONZÁLEZ, J. ALBERTO CONEJERO, GEORGE COSTAKIS, AND JUAN B. SEOANE-SEPÚLVEDA arXiv:1710.10413v1 [math.FA] 28 Oct 2017 Dedicated to Professor Domingo Garcı́a on the occasion of his 60th birthday Abstract. In this note, it is pro...	4
arXiv:1708.05520v1 [cs.DS] 18 Aug 2017 An Optimal Realization Algorithm for Bipartite Graphs with Degrees in Prescribed Intervals∗ Steffen Rechner Institute of Computer Science Martin Luther University Halle-Wittenberg, Germany steffen.rechner@informatik.uni-halle.de March 1, 2018 Abstract We consider the problem of...	8
Dendritic error backpropagation in deep cortical microcircuits João Sacramento1* , Rui Ponte Costa1 , Yoshua Bengio2 , Walter Senn1* 1 Department of Physiology University of Bern, Switzerland 2 arXiv:1801.00062v1 [q-bio.NC] 30 Dec 2017 Montreal Institute for Learning Algorithms Université de Montréal, Quebec, Can...	9
DISCRETE GAUSSIAN DISTRIBUTIONS VIA THETA FUNCTIONS DANIELE AGOSTINI AND CARLOS AMÉNDOLA arXiv:1801.02373v1 [math.AG] 8 Jan 2018 Abstract. We introduce a discrete analogue of the classical multivariate Gaussian distribution. It is parametrized by the Riemann theta function on the integer lattice. Our real-valued dis...	10
Shrinkage Estimation of Covariance Matrix for Portfolio Choice with arXiv:1611.06753v1 [math.ST] 21 Nov 2016 High Frequency Data Cheng Liu, Ningning Xia and Jun Yu ∗ November 22, 2016 Abstract This paper examines the usefulness of high frequency data in estimating the covariance matrix for portfolio choice when th...	10
EXPLICIT DEEP HOLES OF REED-SOLOMON CODES arXiv:1711.02292v1 [cs.IT] 7 Nov 2017 JUN ZHANG AND DAQING WAN Abstract. In this paper, deep holes of Reed-Solomon (RS) codes are studied. A new class of deep holes for generalized affine RS codes is given if the evaluation set satisfies certain combinatorial structure. Three...	7
1 Bounds on the Capacity of Memoryless Simplified Fiber-Optical Channel Models Kamran Keykhosravi, Student Member, IEEE, arXiv:1708.03102v1 [cs.IT] 10 Aug 2017 Giuseppe Durisi, Senior Member, IEEE, and Erik Agrell, Senior Member, IEEE. Abstract A number of simplified models have been proposed for the fiber-optical ...	7
arXiv:1211.6693v3 [math.PR] 4 May 2016 The Annals of Applied Probability 2016, Vol. 26, No. 2, 722–759 DOI: 10.1214/15-AAP1101 c Institute of Mathematical Statistics, 2016 THE MEAN EULER CHARACTERISTIC AND EXCURSION PROBABILITY OF GAUSSIAN RANDOM FIELDS WITH STATIONARY INCREMENTS1 By Dan Cheng and Yimin Xiao North Ca...	10
KOSZUL HYPERSURFACES OVER THE EXTERIOR ALGEBRAS arXiv:1406.0489v1 [math.AC] 2 Jun 2014 HOP D. NGUYEN Abstract. We prove that if E is an exterior algebra over a field, h is a quadratic form, then E/(h) is Koszul if and only if h is a product of two linear forms. 1. The main result Let k be a field. In this note, we c...	0
arXiv:1602.09100v2 [stat.ME] 3 Jul 2017 Bayesian Variable Selection for Skewed Heteroscedastic Response Libo Wang1 , Yuanyuan Tang1 , Debajyoti Sinha1 , Debdeep Pati1 , and Stuart Lipsitz2 1 Department of Statistics, Florida State University, Tallahassee, FL 32306 2 Brigham and Women’s Hospital Abstract In this artic...	10
arXiv:1604.04372v2 [math.AG] 14 Jul 2016 The Chow Form of the Essential Variety in Computer Vision Gunnar Fløystad, Joe Kileel, Giorgio Ottaviani Abstract The Chow form of the essential variety in computer vision is calculated. Our derivation uses secant varieties, Ulrich sheaves and representation theory. Numerical e...	0
PREPRINT 1 SVD-based Kalman Filter Derivative Computation arXiv:1612.04777v2 [cs.SY] 6 Apr 2017 J.V. Tsyganova and M.V. Kulikova Abstract— Recursive adaptive filtering methods are often used for solving the problem of simultaneous state and parameters estimation arising in many areas of research. The gradient-base...	3
DEVELOPMENT OF A CARGO SCREENING PROCESS SIMULATOR: A FIRST APPROACH Peer-Olaf Siebers (a), Galina Sherman (b), Uwe Aickelin (c) (a) Computer Science, Nottingham University, Nottingham, NG8 1BB, UK CASS Business School, City University London, London, EC1Y 8TZ, UK (c) Computer Science, Nottingham University, Nottingha...	5
Counterfactual Conditionals in Quantified Modal Logic Naveen Sundar Govindarajulu and Selmer Bringsjord arXiv:1710.04161v2 [cs.AI] 2 Nov 2017 Rensselaer Polytechnic Institute, Troy, NY {naveensundarg,selmer.bringsjord}@gmail.com Abstract We present a novel formalization of counterfactual conditionals in a quantified...	2
Gradient Descent Learns Linear Dynamical Systems Moritz Hardt∗ Tengyu Ma† Benjamin Recht‡ arXiv:1609.05191v1 [cs.LG] 16 Sep 2016 September 19, 2016 Abstract We prove that gradient descent efficiently converges to the global optimizer of the maximum likelihood objective of an unknown linear time-invariant dynamical...	8
LINEARITY DEFECT OF EDGE IDEALS AND FRÖBERG’S THEOREM arXiv:1506.05769v7 [math.AC] 16 Jan 2016 HOP D. NGUYEN AND THANH VU Abstract. Fröberg’s classical theorem about edge ideals with 2-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem...	0
Noname manuscript No. (will be inserted by the editor) Compositional Falsification of Cyber-Physical Systems with Machine Learning Components Tommaso Dreossi · Alexandre Donzé · Sanjit A. Seshia arXiv:1703.00978v2 [cs.SY] 22 Nov 2017 the date of receipt and acceptance should be inserted later Abstract Cyber-physic...	3
arXiv:1310.7623v2 [math.NT] 30 Oct 2013 DETECTING FAST SOLVABILITY OF EQUATIONS VIA SMALL POWERFUL GALOIS GROUPS S. K. CHEBOLU, J. MINÁČ, AND C. QUADRELLI To Professors Tsit-Yuen Lam and Helmut Koch with admiration and respect. Abstract. Fix an odd prime p, and let F be a field containing a primitive pth root of uni...	0
MANUSCRIPT Regression estimator for the tail index László Németha and András Zemplénib arXiv:1708.04815v2 [stat.ME] 7 Dec 2017 a,b Eötvös Loránd University, Institute of Mathematics, Department of Probability and Statistics, Budapest, Hungary. ARTICLE HISTORY Compiled December 8, 2017 ABSTRACT Estimating the...	10
COMPACT PRESENTABILITY OF TREE ALMOST AUTOMORPHISM GROUPS arXiv:1402.5652v3 [math.GR] 16 Jun 2016 ADRIEN LE BOUDEC Abstract. We establish compact presentability, i.e. the locally compact version of ﬁnite presentability, for an inﬁnite family of tree almost automorphism groups. Examples covered by our results include...	4
A Discontinuity Adjustment arXiv:1702.01081v1 [math.ST] 3 Feb 2017 for Subdistribution Function Confidence Bands Applied to Right-Censored Competing Risks Data Dennis Dobler Ulm University, Institute of Statistics, Helmholtzstr. 20, 89081 Ulm, Germany email: dennis.dobler@uni-ulm.de February 6, 2017 Summary The wild...	10
arXiv:1512.08675v1 [math.RA] 29 Dec 2015 CHIEF FACTORS OF LIE ALGEBRAS DAVID A. TOWERS Abstract. In group theory the chief factors allow a group to be studied by its representation theory on particularly natural irreducible modules. It is to be expected, therefore, that they will play an important role in the study of...	4
Logical Methods in Computer Science Vol. 8 (1:26) 2012, pp. 1–63 www.lmcs-online.org Submitted Published Sep. 7, 2011 Mar. 23, 2012 STATIC ANALYSIS OF RUN-TIME ERRORS IN EMBEDDED REAL-TIME PARALLEL C PROGRAMS ∗ ANTOINE MINÉ CNRS & École Normale Supérieure, 45 rue d’Ulm, 75005 Paris, France e-mail address: mine@di...	6
Estimating the spectral gap of a trace-class Markov operator arXiv:1704.00850v2 [math.ST] 22 Jun 2017 Qian Qin, James P. Hobert and Kshitij Khare Department of Statistics University of Florida June 2017 Abstract The utility of a Markov chain Monte Carlo algorithm is, in large part, determined by the size of the spec...	10
1 Deep Local Binary Patterns arXiv:1711.06597v1 [cs.CV] 17 Nov 2017 Kelwin Fernandes and Jaime S. Cardoso Abstract—Local Binary Pattern (LBP) is a traditional descriptor for texture analysis that gained attention in the last decade. Being robust to several properties such as invariance to illumination translation a...	1
1 Unequal Error Protection Querying Policies for the Noisy 20 Questions Problem Hye Won Chung, Brian M. Sadler, Lizhong Zheng and Alfred O. Hero arXiv:1606.09233v2 [cs.IT] 28 Sep 2017 Abstract In this paper, we propose an open-loop unequal-error-protection querying policy based on superposition coding for the noisy ...	7
Proceedings of the 13th International Conference on Nanochannels, Microchannels and Minichannels ICNMM15 July 6-9, 2015, San Francisco, CA, USA Preprint submitted to ASME InterPACKICNMM2015-48569 A NEW ALGORITHM FOR CONTACT ANGLE ESTIMATION IN MOLECULAR DYNAMICS SIMULATIONS Sumith YD Department of Mechanical and Aero...	5
Discontinuous energy shaping control of the Chaplygin sleigh Joel Ferguson ∗ Alejandro Donaire ∗∗ Richard H. Middleton ∗ arXiv:1801.06278v1 [cs.SY] 19 Jan 2018 ∗ School of Electrical Engineering and Computing and PRC CDSC, The University of Newcastle, Callaghan, NSW 2308, Australia (e-mail: Joel.Ferguson@uon.edu.au; ...	3
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering Buddhima Gamlath buddhima.gamlath@epfl.ch Sangxia Huang huang.sangxia@gmail.com arXiv:1803.00926v1 [cs.DS] 2 Mar 2018 Ola Svensson ola.svensson@epfl.ch Abstract We study k-means clustering in a semi-supervised setting. Given an oracle that ...	8
Synthesis of Surveillance Strategies via Belief Abstraction arXiv:1709.05363v2 [cs.RO] 19 Mar 2018 Suda Bharadwaj1 and Rayna Dimitrova2 and Ufuk Topcu1 Abstract— We study the problem of synthesizing a controller for a robot with a surveillance objective, that is, the robot is required to maintain knowledge of the lo...	3
Trajectory Generation using Sharpness Continuous Dubins-like Paths with Applications in Control of Heavy Duty Vehicles arXiv:1801.08995v1 [cs.SY] 26 Jan 2018 Rui Oliveira1,2 , Pedro F. Lima1,2 , Marcello Cirillo2 , Jonas Mårtensson1 and Bo Wahlberg1 Abstract— We present a trajectory generation framework for control ...	3
arXiv:1704.05295v1 [cs.AI] 18 Apr 2017 Semantic Similarity from Natural Language and Ontology analysis preprint Sébastien Harispe, Sylvie Ranwez, Stefan Janaqi, Jacky Montmain Ecole des mines d’Alès - LGI2P ii Abstract Artificial Intelligence federates numerous scientific fields in the aim of developing machines...	2
”This work has been submitted to IEEE PIMRC 2017 conference for possible publication. Copyright may be transferred without prior notice, after which this version may no longer be accessible” arXiv:1705.09098v1 [cs.IT] 25 May 2017 Performance Optimization of Co-Existing Underlay Secondary Networks Pratik Chakraborty ...	7
arXiv:1803.09686v1 [math.PR] 26 Mar 2018 Strict monotonicity of pc under covering maps Sébastien Martineau∗ and Franco Severo† March 28, 2018 Abstract We answer a question of Benjamini and Schramm by proving that under reasonable conditions, quotienting a graph with pc < 1 strictly increases the value of pc . More pr...	4
Document Listing on Repetitive Collections with Guaranteed Performance∗ Gonzalo Navarro Center for Biotechnology and Bioengineering, Dept. of Computer Science, University of Chile, Beauchef 851, Santiago, Chile. gnavarro@dcc.uchile.cl arXiv:1707.06374v1 [cs.DS] 20 Jul 2017 Abstract We consider document listing on str...	8
Algebraic characterisations of negatively-curved special groups and applications to graph braid groups Anthony Genevois September 6, 2017 arXiv:1709.01258v1 [math.GR] 5 Sep 2017 Abstract In this paper, we introduce a combinatorial formalism to study (virtually) special groups, introduced by Haglund and Wise. As a fir...	4
arXiv:1602.00213v2 [math.GR] 26 Jul 2016 COMMENSURATED SUBGROUPS IN FINITELY GENERATED BRANCH GROUPS PHILLIP WESOLEK Abstract. A subgroup H ≤ G is commensurated if \|H : H ∩gHg −1 \| < ∞ for all g ∈ G. We show that a finitely generated branch group is just infinite if and only if every commensurated subgroup is either f...	4
1 A Multi- or Many-Objective Evolutionary Algorithm with Global Loop Update arXiv:1803.06282v1 [cs.NE] 25 Jan 2018 Yingyu Zhang Bing Zeng Abstract—Multior many-objective evolutionary algorithms(MOEAs), especially the decomposition-based MOEAs have been widely concerned in recent years. The decomposition-based MOEA...	9
Experimental Evaluation of Residential Demand Response in California arXiv:1710.03190v3 [physics.soc-ph] 10 Jan 2018 Datong P. Zhou∗ , Maximilian Balandat† , and Claire J. Tomlin† Abstract— We evaluate the causal effect of hour-ahead price interventions on the reduction of residential electricity consumption, using ...	3
arXiv:1702.01271v1 [math.GR] 4 Feb 2017 FINITE ORDER ELEMENTS IN THE INTEGRAL SYMPLECTIC GROUP KUMAR BALASUBRAMANIAN, M. RAM MURTY, AND KARAM DEO SHANKHADHAR Abstract For g ∈ N, let G = Sp(2g, Z) be the integral symplectic group and S(g) be the set of all positive integers which can occur as the order of an element i...	4
Unsupervised Gene Expression Data using Enhanced Clustering Method T.Chandrasekhar K.Thangavel E.Elayaraja E.N.Sathishkumar Dept. of Computer Science Periyar University Salem, India ch_ansekh80@rediffmail.com Dept. of Computer Science Periyar University Salem, India drktvel@gmail.com Dept. of Computer Science Per...	5
Algorithmica manuscript No. (will be inserted by the editor) Efficiently Correcting Matrix Products arXiv:1602.00435v2 [cs.DS] 18 Aug 2016 Leszek Gasieniec ˛ · Christos Levcopoulos · Andrzej Lingas · Rasmus Pagh · Takeshi Tokuyama Abstract We study the problem of efficiently correcting an erroneous product of two n...	8
Acceleration of Histogram-Based Contrast Enhancement Accelerate Histogram-Based Contrast Enhancement by via Selective Downsampling Selective Downsampling Gang Cao1*, Huawei Tian2, Lifang Yu3, Xianglin Huang1 and Yongbin Wang1 1 School of Computer Science, Communication University of China, Beijing, China 2 3 People’...	1
arXiv:1211.6134v2 [math.DG] 29 Apr 2013 ON THEORIES OF SUPERALGEBRAS OF DIFFERENTIABLE FUNCTIONS DAVID CARCHEDI AND DMITRY ROYTENBERG Abstract. This is the first in a series of papers laying the foundations for a differential graded approach to derived differential geometry (and other geometries in characteristic zer...	0
A Distributed Message-Optimal Assignment on Rings∗ arXiv:1502.02427v2 [cs.DS] 9 Sep 2015 Gianluca De Marco† Mauro Leoncini‡ Manuela Montangero§ Abstract Consider a set of items and a set of m colors, where each item is associated to one color. Consider also n computational agents connected by a ring. Each agent ho...	8
THE s-MULTIPLICITY FUNCTION OF 2 × 2-DETERMINANTAL RINGS arXiv:1708.06287v2 [math.AC] 13 Oct 2017 LANCE EDWARD MILLER AND WILLIAM D. TAYLOR Abstract. This article generalizes joint work of the first author and I. Swanson to the s-multiplicity recently introduced by the second author. For k a field and X = [xi,j ] a ...	0
INVARIANT RANDOM SUBGROUPS OF LINEAR GROUPS arXiv:1407.2872v3 [math.GR] 22 Jan 2016 YAIR GLASNER With an appendix by Tsachik Gelander and Yair Glasner Abstract. Let Γ < GLn (F ) be a countable non-amenable linear group with a simple, center free Zariski closure. Let Sub(Γ) denote the space of all subgroups of Γ with...	4
> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) 1 Risk-limiting Load Restoration for Resilience Enhancement with Intermittent Energy Resources Zhiwen Wang, Student Member, IEEE, Chen Shen, Senior Member, IEEE, Yin Xu, Member, IEEE, Feng Liu, Member, IEEE, Xiangyu Wu, Student Memb...	3
A Covert Queueing Channel 1 in FCFS Schedulers AmirEmad Ghassami and Negar Kiyavash arXiv:1707.07234v1 [cs.IT] 23 Jul 2017 Abstract We study covert queueing channels (CQCs), which are a kind of covert timing channel that may be exploited in shared queues across supposedly isolated users. In our system model, a user...	7
Faster Algorithms for Large-scale Machine Learning using Simple Sampling Techniques arXiv:1801.05931v2 [cs.LG] 5 Feb 2018 Vinod Kumar Chauhan 1 Kalpana Dahiya 2 Anuj Sharma 1 Abstract Now a days, the major challenge in machine learning is the ‘Big Data’ challenge. The big data problems due to large number of data po...	2
Formation Control and Network Localization via Distributed Global Orientation Estimation in 3-D arXiv:1708.03591v1 [cs.SY] 10 Aug 2017 Byung-Hun Lee† and Hyo-Sung Ahn† Abstract—In this paper, we propose a novel distributed formation control strategy, which is based on the measurements of relative position of neighbo...	3
Shaping Pulses to Control Bistable Monotone Systems Using Koopman Operator Aivar Sootla ∗ Alexandre Mauroy ∗∗ Jorge Goncalves ∗∗∗ arXiv:1605.06252v1 [cs.SY] 20 May 2016 ∗ Montefiore Institute, University of Liège, B-4000 Liège, Belgium (e-mail: asootla@ulg.ac.be). ∗∗ Luxembourg Centre for Systems Biomedicine, Univ...	3
AUTOMORPHISMS OF HARBATER–KATZ–GABBER CURVES arXiv:1509.02139v2 [math.AG] 2 Nov 2016 FRAUKE M. BLEHER, TED CHINBURG*, BJORN POONEN†, AND PETER SYMONDS Abstract. Let k be a perfect field of characteristic p > 0, and let G be a finite group. We consider the pointed G-curves over k associated by Harbater, Katz, and Ga...	4
Towards an Empirical Study of Affine Types for Isolated Actors in Scala Philipp Haller Fredrik Sommar KTH Royal Institute of Technology Stockholm, Sweden phaller@kth.se KTH Royal Institute of Technology Stockholm, Sweden fsommar@kth.se LaCasa is a type system and programming model to enforce the object capability d...	6
Fibred product of commutative algebras: generators and relations arXiv:1307.2192v3 [math.AG] 13 Jul 2016 Nadezda V. TIMOFEEVA P.G. Demidov Yaroslavl’ State University Sovetskaya str. 14, 150000 Yaroslavl’, Russia e-mail: ntimofeeva@list.ru The method of direct computation of universal (fibred) product in the categor...	0
arXiv:1710.03210v1 [cs.IT] 9 Oct 2017 Joint Coordination-Channel Coding for Strong Coordination over Noisy Channels Based on Polar Codes Sarah A. Obead, Jörg Kliewer Badri N. Vellambi Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark, New Jersey 07102 Email:sao23@njit.edu, ...	7
Can Negligible Cooperation Increase Capacity? The Average-Error Case Parham Noorzad, Michelle Effros, Michael Langberg Abstract arXiv:1801.03655v1 [cs.IT] 11 Jan 2018 In communication networks, cooperative strategies are coding schemes where network nodes work together to improve network performance metrics such as ...	7
MRI Tumor Segmentation with Densely Connected 3D CNN Lele Chen†1 , Yue Wu†1 , Adora M. DSouza2 , Anas Z. Abidin3 , Axel Wismüller2,3,4,5 , and Chenliang Xu1 1 Department of Computer Science, University of Rochester, NY, USA Department of Electrical Engineering, University of Rochester, NY, USA 3 Department of Biomedi...	1
Markov Brains: A Technical Introduction Arend Hintze1,2,3 , Jeffrey A. Edlund4 , Randal S. Olson5 , David B. Knoester3,10 , Jory Schossau1,2,3 , Larissa Albantakis6 , Ali Tehrani-Saleh1,3 9 Peter Kvam , Leigh Sheneman1,3 , Heather Goldsby1,2,3 , Clifford Bohm2,3 and Christoph Adami3,10,11 arXiv:1709.05601v1 [cs.AI] 17...	2
On a frame theoretic measure of quality of LTI systems arXiv:1703.07539v1 [math.OC] 22 Mar 2017 Mohammed Rayyan Sheriff, Debasish Chatterjee Abstract—It is of practical significance to define the notion of a measure of quality of a control system, i.e., a quantitative extension of the classical notion of controllabi...	3
Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics arXiv:1609.09548v1 [cs.DS] 29 Sep 2016 Moses Charikar∗ Vaggos Chatziafratis∗ October 3, 2016 Abstract Dasgupta recently introduced a cost function for the hierarchical clustering of a set of points given pairwise similarities between them. H...	8
Published as a conference paper at ICLR 2018 M ODELING L ATENT ATTENTION W ITHIN N EURAL N ETWORKS arXiv:1706.00536v2 [cs.AI] 30 Dec 2017 Christopher Grimm crgrimm@umich.edu Department of Computer Science & Engineering University of Michigan Dilip Arumugam, Siddharth Karamcheti, David Abel, Lawson L.S. Wong, Michae...	2
1 Minimal Reachability is Hard To Approximate arXiv:1710.10244v3 [cs.SY] 20 Feb 2018 A. Jadbabaie, A. Olshevsky, G. J. Pappas, V. Tzoumas Abstract—In this note, we consider the problem of choosing which nodes of a linear dynamical system should be actuated so that the state transfer from the system’s initial condit...	3
Synthesizing Neural Network Controllers with Probabilistic Model-Based Reinforcement Learning arXiv:1803.02291v1 [cs.RO] 6 Mar 2018 Juan Camilo Gamboa Higuera, David Meger, and Gregory Dudek Abstract— We present an algorithm for rapidly learning controllers for robotics systems. The algorithm follows the model-based ...	2
arXiv:1509.08255v2 [cs.NE] 8 Oct 2015 Encoding Reality: Prediction-Assisted Cortical Learning Algorithm in Hierarchical Temporal Memory Fergal Byrne HTM Theory Group, Dublin, Ireland fergal@brenter.ie http://inbits.com In the decade since Jeff Hawkins proposed Hierarchical Temporal Memory (HTM) as a model of neocorti...	9
arXiv:1709.06502v1 [math.AC] 19 Sep 2017 RIESZ SPACE-VALUED STATES ON PSEUDO MV-ALGEBRAS ANATOLIJ DVUREČENSKIJ1,2 1 Mathematical Institute, Slovak Academy of Sciences Štefánikova 49, SK-814 73 Bratislava, Slovakia 2 Depart. Algebra Geom., Palacký Univer. 17. listopadu 12, CZ-771 46 Olomouc, Czech Republic E-mail...	0
arXiv:1303.3469v1 [cs.NE] 14 Mar 2013 Hybrid Evolutionary Computation for Continuous Optimization Technical Memorandum 2011-v.01 School of Computer Science, University of Manchester, Kilburn Building, Oxford Road, MANCHESTER, M13 9PL Supervisor: Dr. Richard Neville Author: Hassan A Bashir November 9, 2011 This mat...	9
Towards Automatic Learning of Heuristics for Mechanical Transformations of Procedural Code Guillermo Vigueras Salvador Tamarit Manuel Carro Universidad Politécnica de Madrid Campus de Montegancedo 28660 Boadilla del Monte, Madrid, Spain {salvador.tamarit,julio.marino}@upm.es arXiv:1603.03022v2 [cs.PL] 10 Mar 2016 ...	6
Probabilistically Safe Policy Transfer arXiv:1705.05394v1 [cs.RO] 15 May 2017 David Held1 , Zoe McCarthy1 , Michael Zhang1 , Fred Shentu1 , and Pieter Abbeel1,2,3 Abstract— Although learning-based methods have great potential for robotics, one concern is that a robot that updates its parameters might cause large amo...	2
arXiv:1609.03000v2 [cs.DS] 22 Mar 2018 Computing longest single-arm-gapped palindromes in a string Shintaro Narisada1 , Diptarama1 , Kazuyuki Narisawa1 , Shunsuke Inenaga2 , and Ayumi Shinohara1 1 Graduate School of Information Sciences, Tohoku University, Japan {shintaro narisada, diptarama}@shino.ecei.tohoku.ac.jp ...	8
Learning Based on CC1 and CC4 Neural Networks Subhash Kak Oklahoma State University Abstract— We propose that a general learning system should have three kinds of agents corresponding to sensory, short-term, and long-term memory that implicitly will facilitate context-free and context-sensitive aspects of learning. Th...	9
A NOTE ON THE ENUMERATION OF EUCLIDEAN SELF-DUAL SKEW-CYCLIC CODES OVER FINITE FIELDS arXiv:1705.06049v1 [cs.IT] 17 May 2017 IRWANSYAH, INTAN MUCHTADI-ALAMSYAH, AHMAD MUCHLIS, ALEAMS BARRA, AND DJOKO SUPRIJANTO Abstract. In this paper, we give the enumeration formulas for Euclidean selfdual skew-cyclic codes over fin...	7
BES with FEM: Building Energy Simulation using Finite Element Methods A.W.M. (Jos) van Schijndel Eindhoven University of Technology P.O. Box 513; 5600 MB Eindhoven; Netherlands, A.W.M.v.Schijndel@tue.nl Abstract: An overall objective of energy efficiency in the built environment is to improve building and systems perf...	5
Partially Independent Control Scheme for Spacecraft Rendezvous in Near-Circular Orbits Neng Wan and Weiran Yao Abstract Due to the complexity and inconstancy of the space environment, accurate mathematical models for spacecraft arXiv:1409.2332v4 [cs.SY] 4 Jan 2016 rendezvous are difficult to obtain, which consequentl...	3
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time arXiv:1607.04346v2 [cs.DS] 14 Nov 2016 J. Ian Munro∗ Gonzalo Navarro† Yakov Nekrich‡ Abstract We show that the compressed suffix array and the compressed suffix tree of a string T can be built in O(n) deterministic time using O(n log σ...	8
On classes of finite groups with simple non-abelian chief factors arXiv:1711.01686v1 [math.GR] 6 Nov 2017 V. I. Murashka {mvimath@yandex.ru} Francisk Skorina Gomel State University, Gomel, Belarus Abstract. Let J be a class of non-abelian simple groups and X be a class of groups. A chief factor H/K of a group G is ca...	4
Proceedings of the ASME 2017 Dynamic Systems and Control Conference DSCC2017 October 11-13, 2017 Tysons Corner, Virginia, USA DSCC2017-**** REAL-TIME BRAIN MACHINE INTERACTION VIA SOCIAL ROBOT GESTURE CONTROL Reza Abiri Department of Mechanical, Aerospace, and Biomedical Engineering University of Tennessee, Knoxville ...	3
1 The Dirty MIMO Multiple-Access Channel arXiv:1510.08018v4 [cs.IT] 17 Jun 2017 Anatoly Khina, Yuval Kochman, and Uri Erez Abstract—In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown...	7
Optimal Lower Bounds for Sketching Graph Cuts Charles Carlson∗ Alexandra Kolla † Nikhil Srivastava‡ Luca Trevisan§ arXiv:1712.10261v1 [cs.DS] 29 Dec 2017 January 1, 2018 Abstract We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approxi...	8
Detecting Anomalous Faces with ‘No Peeking’ Autoencoders Anand Bhattad 1 Jason Rock 1 David Forsyth 1 arXiv:1802.05798v1 [cs.CV] 15 Feb 2018 Abstract Detecting anomalous faces has important applications. For example, a system might tell when a train driver is incapacitated by a medical event, and assist in adopting ...	1
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case Yuko Kuroki and Tomomi Matsui Department of Industrial Engineering and Economics, Tokyo Institute of Technology arXiv:1803.06114v1 [cs.DM] 16 Mar 2018 kuroki.y.aa@m.titech.ac.jp...	8
Gaussian Process Model Predictive Control of Unknown Nonlinear Systems Gang Cao1,* , Edmund M-K Lai2 , Fakhrul Alam1 arXiv:1612.01211v1 [cs.SY] 5 Dec 2016 1 School of Engineering and Advanced Technology, Massey University, Auckland, New Zealand. Department of Information Technology and Software Engineering, Auckland...	3
Storage Capacity as an Information-Theoretic Analogue of Vertex Cover* arXiv:1706.09197v1 [cs.IT] 28 Jun 2017 Arya Mazumdar Andrew McGregor Sofya Vorotnikova Abstract Motivated by applications in distributed storage, the storage capacity of a graph was recently defined to be the maximum amount of information that ...	7
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem arXiv:1706.06920v2 [cs.NE] 19 Dec 2017 Anton V. Eremeev, Yulia V. Kovalenko∗ December 20, 2017 Sobolev Institute of Mathematics, 4, Akad. Koptyug avenue, 630090, Novosibirsk, Russia. Email: eremeev@oﬁm.oscsbras.ru, julia.koval...	9
Chained Successive Cancellation Decoding of the Extended Golay code Peter Trifonov arXiv:1801.06315v1 [cs.IT] 19 Jan 2018 Saint Petersburg Polytechnic University, Russia Email: petert@dcn.icc.spbstu.ru Abstract—The extended Golay code is shown to be representable as a chained polar subcode. This enables its decoding...	7
Elements of Effective Deep Reinforcement Learning towards Tactical Driving Decision Making arXiv:1802.00332v1 [cs.AI] 1 Feb 2018 Jingchu Liu, Pengfei Hou, Lisen Mu, Yinan Yu, and Chang Huang Horizon Robotics, inc. {jingchu.liu, pengfei01.hou, lisen.mu, yinan.yu, chang.huang}@hobot.cc Abstract Tactical driving decisi...	2
DYNAMIC CHARACTERIZATIONS OF QUASI-ISOMETRY, AND APPLICATIONS TO COHOMOLOGY arXiv:1604.07375v4 [math.GR] 18 Apr 2017 XIN LI A BSTRACT. We build a bridge between geometric group theory and topological dynamical systems by establishing a dictionary between coarse equivalence and continuous orbit equivalence. As an app...	4
arXiv:1709.01535v1 [cs.DS] 5 Sep 2017 Just Take the Average! An Embarrassingly Simple 2n-Time Algorithm for SVP (and CVP) Divesh Aggarwal Centre for Quantum Technologies dcsdiva@nus.edu.sg Noah Stephens-Davidowitz∗ New York University noahsd@gmail.com Abstract n+o(n) We show a 2 -time (and space) algorithm for the ...	8
Inferring Generative Model Structure with Static Analysis Paroma Varma, Bryan He, Payal Bajaj, Imon Banerjee, Nishith Khandwala, Daniel L. Rubin, Christopher Ré arXiv:1709.02477v1 [cs.LG] 7 Sep 2017 Stanford University {paroma,bryanhe,pabajaj,imonb,nishith,rubin}@stanford.edu, chrismre@cs.stanford.edu Abstract Obtai...	2
manuscript No. (will be inserted by the editor) Competitive Fragmentation Modeling of ESI-MS/MS spectra for putative metabolite identification arXiv:1312.0264v3 [cs.CE] 9 Jun 2014 Felicity Allen · Russ Greiner · David Wishart Abstract Electrospray tandem mass spectrometry (ESI-MS/MS) is commonly used in high throug...	5
L EARNING TO M IX n-S TEP R ETURNS : G ENERALIZING λ-R ETURNS FOR D EEP R EINFORCEMENT L EARNING arXiv:1705.07445v2 [cs.LG] 5 Nov 2017 Sahil Sharma, Girish Raguvir J∗, Srivatsan Ramesh∗, Balaraman Ravindran Indian Institute of Technology, Madras Chennai, 600036, India sahil@cse.iitm.ac.in {girishraguvir,sriramesh4}@g...	2

Subsets and Splits

No community queries yet

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