Split (3)

train · 1k rows

text stringlengths 7.27k 650k	label int64 0 10
arXiv:1608.03703v2 [] 26 Apr 2017 Template estimation in computational anatomy: Fréchet means in top and quotient spaces are not consistent Loïc Devilliers∗, Stéphanie Allassonnière†, Alain Trouvé‡, and Xavier Pennec§ April 27, 2017 Abstract In this article, we study the consistency of the template estimation with th...	10
Tiny SSD: A Tiny Single-shot Detection Deep Convolutional Neural Network for Real-time Embedded Object Detection arXiv:1802.06488v1 [] 19 Feb 2018 Alexander Wong, Mohammad Javad Shafiee, Francis Li, Brendan Chwyl Dept. of Systems Design Engineering University of Waterloo, DarwinAI {a28wong, mjshafiee}@uwaterloo.ca, {...	1
1 An overview of deep learning based methods for unsupervised and semi-supervised anomaly detection in videos arXiv:1801.03149v2 [] 30 Jan 2018 B Ravi Kiran, Dilip Mathew Thomas, Ranjith Parakkal Abstract—Videos represent the primary source of information for surveillance applications and are available in large amou...	1
Energy Clustering Guilherme França∗ and Joshua T. Vogelstein† Johns Hopkins University Abstract arXiv:1710.09859v1 [stat.ML] 26 Oct 2017 Energy statistics was proposed by Székely in the 80’s inspired by the Newtonian gravitational potential from classical mechanics, and it provides a hypothesis test for equality o...	1
Bayesian Probabilistic Numerical Methods Jon Cockayne∗ Chris Oates† Tim Sullivan‡ Mark Girolami§ arXiv:1702.03673v2 [stat.ME] 7 Jul 2017 July 10, 2017 The emergent field of probabilistic numerics has thus far lacked clear statistical principals. This paper establishes Bayesian probabilistic numerical methods as t...	10
Inverse Stability Problem and Applications to Renewables Integration arXiv:1703.04491v5 [] 14 Oct 2017 Thanh Long Vu∗ , Hung Dinh Nguyen, Alexandre Megretski, Jean-Jacques Slotine and Konstantin Turitsyn Abstract—In modern power systems, the operating point, at which the demand and supply are balanced, may take diff...	3
arXiv:1201.3325v2 [] 14 Aug 2012 SIMPLICIAL COMPLEXES WITH RIGID DEPTH ADNAN ASLAM AND VIVIANA ENE Abstract. We extend a result of Minh and Trung [8] to get criteria for √ depth I = depth I where I is an unmixed monomial ideal of the polynomial ring S = K[x1 , . . . , xn ]. As an application we characterize all the pu...	0
Orthogonal Series Density Estimation for Complex Surveys Shangyuan Ye, Ye Liang and Ibrahim A. Ahmad arXiv:1709.06588v2 [stat.ME] 26 Sep 2017 Department of Statistics, Oklahoma State University Abstract We propose an orthogonal series density estimator for complex surveys, where samples are neither independent nor i...	10
A Parametric MPC Approach to Balancing the Cost of Abstraction for Differential-Drive Mobile Robots arXiv:1802.07199v1 [cs.RO] 20 Feb 2018 Paul Glotfelter and Magnus Egerstedt Abstract— When designing control strategies for differentialdrive mobile robots, one standard tool is the consideration of a point at a fixed ...	3
Online Model Estimation for Predictive Thermal Control of Buildings Peter Radecki, Member, IEEE, and Brandon Hencey, Member, IEEE  Ideally, a Building Automation System (BAS) would automatically modify set-points and load shedding based on weather, occupancy, and utility pricing predictions [8]. Every building has u...	3
1 Chance-Constrained Day-Ahead Hourly Scheduling in Distribution System Operation Yi Gu1 , Student Member, IEEE, Huaiguang Jiang2, Member, IEEE, Jun Jason Zhang1 , Senior Member, IEEE, Yingchen Zhang2 , Senior Member, IEEE, Eduard Muljadi2, Fellow, IEEE, and Francisco J. Solis3 , Senior Member 1 arXiv:1711.10687v1 []...	3
POLYHEDRAL PRODUCTS AND COMMUTATOR SUBGROUPS OF RIGHT-ANGLED ARTIN AND COXETER GROUPS TARAS PANOV AND YAKOV VERYOVKIN arXiv:1603.06902v2 [] 1 Sep 2016 To the memory of Rainer Vogt Abstract. We construct and study polyhedral product models for classifying spaces of right-angled Artin and Coxeter groups, general graph ...	4
IDEAL-ADIC COMPLETION OF QUASI-EXCELLENT RINGS (AFTER GABBER) arXiv:1609.09246v1 [] 29 Sep 2016 KAZUHIKO KURANO AND KAZUMA SHIMOMOTO Abstract. In this paper, we give a detailed proof to a result of Gabber (unpublished) on the ideal-adic completion of quasi-excellent rings, extending the previous work on Nishimura-Nis...	0
Automated Speed and Lane Change Decision Making using Deep Reinforcement Learning Carl-Johan Hoel∗† , Krister Wolff∗ , Leo Laine∗† ∗ Chalmers University of Technology, 412 96 Göteborg, Sweden Group Trucks Technology, 405 08 Göteborg, Sweden Email: {carl-johan.hoel, krister.wolff, leo.laine}@chalmers.se arXiv:1803.1...	2
arXiv:1712.08397v1 [math.RA] 22 Dec 2017 KÄHLER–POISSON ALGEBRAS JOAKIM ARNLIND AND AHMED AL-SHUJARY Abstract. We introduce Kähler–Poisson algebras as analogues of algebras of smooth functions on Kähler manifolds, and prove that they share several properties with their classical counterparts on an algebraic level. ...	0
Instruction Sequence Notations with Probabilistic Instructions arXiv:0906.3083v2 [] 1 Oct 2014 J.A. Bergstra and C.A. Middelburg Informatics Institute, Faculty of Science, University of Amsterdam, Science Park 107, 1098 XG Amsterdam, the Netherlands J.A.Bergstra@uva.nl,C.A.Middelburg@uva.nl Abstract. This paper conc...	6
Formal verification of an interior point algorithm instanciation Guillaume Davy∗‡ , Eric Feron† , Pierre-Loic Garoche∗ , and Didier Henrion‡ arXiv:1801.03833v1 [cs.LO] 11 Jan 2018 ∗ Onera - The French Aerospace Lab, Toulouse, FRANCE ‡ CNRS LAAS, Toulouse, FRANCE † Georgia Institute of Technology, Atlanta GA, USA Ab...	3
Adjacency Criterion For Gradient Flow With Multiple Local Maxima arXiv:1412.6731v3 [math.DS] 8 Sep 2017 Xudong Chen1 Abstract— In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establis...	3
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams Paweł Gawrychowski1 , Oleg Merkurev2 , Arseny M. Shur2 , and Przemysław Uznański3 1 arXiv:1610.03125v1 [] 10 Oct 2016 2 Institute of Informatics, University of Warsaw, Poland Institute of Mathematics and Computer Science, Ural Federal Univ...	8
On Hierarchical Communication Topologies in the π-calculus Emanuele D’Osualdo1 and C.-H. Luke Ong2 arXiv:1601.01725v2 [] 19 Apr 2016 1 TU Kaiserslautern dosualdo@cs.uni-kl.de 2 University of Oxford lo@cs.ox.ac.uk Abstract. This paper is concerned with the shape invariants satisfied by the communication topology of ...	6
Convergence Rate of Riemannian Hamiltonian Monte Carlo and Faster Polytope Volume Computation arXiv:1710.06261v1 [] 17 Oct 2017 Yin Tat Lee∗, Santosh S. Vempala† October 18, 2017 Abstract We give the first rigorous proof of the convergence of Riemannian Hamiltonian Monte Carlo, a general (and practical) method for s...	8
arXiv:1710.08585v1 [cs.LG] 24 Oct 2017 Max-Margin Invariant Features from Transformed Unlabeled Data Dipan K. Pal, Ashwin A. Kannan∗, Gautam Arakalgud∗, Marios Savvides Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh, PA 15213 {dipanp,aalapakk,garakalgud,marioss}@cmu.edu Abstra...	7
arXiv:1703.03963v1 [] 11 Mar 2017 On Solving Travelling Salesman Problem with Vertex Requisitions∗ Anton V. EREMEEV Omsk Branch of Sobolev Institute of Mathematics SB RAS, Omsk State University n.a. F.M. Dostoevsky eremeev@ofim.oscsbras.ru Yulia V. KOVALENKO Sobolev Institute of Mathematics SB RAS, julia.kovalenko.ya@...	8
PyCraters: A Python framework for crater function analysis Scott A. Norris arXiv:1410.8489v1 [physics.comp-ph] 28 Oct 2014 October 31, 2014 Abstract We introduce a Python framework designed to automate the most common tasks associated with the extraction and upscaling of the statistics of single-impact crater functio...	5
Implementation of a Direct Coupling Coherent Quantum Observer including Observer Measurements arXiv:1603.01436v1 [quant-ph] 4 Mar 2016 Ian R. Petersen and Elanor H. Huntington Abstract— This paper considers the problem of constructing a direct coupling quantum observer for a quantum harmonic oscillator system. The pr...	3
Noname manuscript No. (will be inserted by the editor) Multi-point Codes from the GGS Curves arXiv:1706.00313v3 [] 29 Jun 2017 Chuangqiang Hu · Shudi Yang Received: date / Accepted: date Abstract This paper is concerned with the construction of algebraic geometric codes defined from GGS curves. It is of significan...	7
Overcoming Exploration in Reinforcement Learning with Demonstrations arXiv:1709.10089v2 [cs.LG] 25 Feb 2018 Ashvin Nair12 , Bob McGrew1 , Marcin Andrychowicz1 , Wojciech Zaremba1 , Pieter Abbeel12 Abstract— Exploration in environments with sparse rewards has been a persistent problem in reinforcement learning (RL). M...	9
1 Minimizing the Maximum End-to-End Network Delay: Hardness, Algorithm, and Performance arXiv:1707.02650v3 [] 16 Feb 2018 Qingyu Liu, Lei Deng, Haibo Zeng, Minghua Chen Abstract—We consider the scenario where a source streams a flow at a fixed rate to a receiver across the network, possibly using multiple paths. Ea...	8
PROTEIN THREADING BASED ON NONLINEAR INTEGER PROGRAMMING Wajeb Gharib Gharibi Department of Computer Engineering & Networks Jazan University Jazan 82822-6694, Saudi Arabia Gharibi@jazanu.edu.sa Marwah Mohammed Bakri Department of Biology Jazan University Jazan 755, Saudi Arabia Marwah890@gmail.com Abstract PDB in th...	5
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG 68 Timing and Code Size Optimization on Achieving Full Parallelism in Uniform Nested Loops Y. Elloumi, M.Akil and M.H. Bedoui Abstract- Multidimensional Retiming is one of th...	6
International Journal of Distributed and Parallel Systems (IJDPS) Vol.2, No.6, November 2011 DISTRIBUTED EVOLUTIONARY COMPUTATION: A NEW TECHNIQUE FOR SOLVING LARGE NUMBER OF EQUATIONS Moslema Jahan, M. M. A Hashem and Gazi Abdullah Shahriar Department of Computer Science and Engineering, Khulna University of Engineer...	9
A Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts arXiv:1302.3672v7 [cs.CG] 15 Sep 2016 Jiun-Jie Wang State University of New York at Buffalo, Buffalo, NY 14260, USA. Email: jiunjiew@buffalo.edu Abstract A rectangular layout L is a rectangle partitioned into disjoint smaller rectangles so tha...	8
A NORMAL GENERATING SET FOR THE TORELLI GROUP OF A COMPACT NON-ORIENTABLE SURFACE Abstract. For a compact surface S, let I(S) denote the Torelli group of S. For a compact orientable surface Σ, I(Σ) is generated by BSCC maps and BP maps (see [10] and [11]). For a non-orientable closed surface N , I(N ) is generated by ...	4
Tensor network method for reversible classical computation Zhi-Cheng Yang,1 Stefanos Kourtis,1 Claudio Chamon,1 Eduardo R. Mucciolo,2 and Andrei E. Ruckenstein1 arXiv:1708.08932v2 [cond-mat.stat-mech] 5 Feb 2018 2 1 Physics Department, Boston University, Boston, Massachusetts 02215, USA Department of Physics, Univer...	8
On completeness of logical relations for monadic types ⋆ Sławomir Lasota1 ⋆⋆ David Nowak2 Yu Zhang3 ⋆ ⋆ ⋆ arXiv:cs/0612106v1 [cs.LO] 21 Dec 2006 1 Institute of Informatics, Warsaw University, Warszawa, Poland 2 Research Center for Information Security, National Institute of Advanced Industrial Science and Technol...	2
arXiv:1303.6011v1 [math.FA] 25 Mar 2013 THE INVERSE FUNCTION THEOREM AND THE RESOLUTION OF THE JACOBIAN CONJECTURE IN FREE ANALYSIS J. E. PASCOE Abstract. We establish an invertibility criterion for free polynomials and free functions evaluated on some tuples of matrices. We show that if the derivative is nonsingular ...	0
Hypercube LSH for approximate near neighbors Thijs Laarhoven arXiv:1702.05760v1 [] 19 Feb 2017 IBM Research Rüschlikon, Switzerland mail@thijs.com Abstract. A celebrated technique for finding near neighbors for the angular distance involves using a set of random hyperplanes to partition the space into hash regions ...	8
arXiv:1609.07450v3 [cs.DM] 21 Feb 2018 Finding long simple paths in a weighted digraph using pseudo-topological orderings Miguel Raggi ∗ mraggi@gmail.com Escuela Nacional de Estudios Superiores Universidad Nacional Autónoma de México Abstract Given a weighted digraph, finding the longest path without repeated verti...	8
Seshadri constants via Okounkov functions and the Segre-Harbourne-Gimigliano-Hirschowitz Conjecture M. Dumnicki, A. Küronya∗, C. Maclean, T. Szemberg† arXiv:1304.0249v1 [math.AG] 31 Mar 2013 April 2, 2013 Abstract In this paper we relate the SHGH Conjecture to the rationality of onepoint Seshadri constants on blow ...	0
A Supervisory Control Algorithm Based on Property-Directed Reachability⋆ arXiv:1711.06501v1 [] 17 Nov 2017 Koen Claessen1 , Jonatan Kilhamn1 , Laura Kovács13 , and Bengt Lennartson2 1 Department of Computer Science and Engineering, 2 Department of Electrical Engineering, Chalmers University of Technology 3 Faculty ...	3
Throughput-Optimal Broadcast in Wireless Networks with Dynamic Topology Abhishek Sinha Leandros Tassiulas Eytan Modiano Laboratory for Information and Decision Systems MIT Electrical Engg. and Yale Institute of Network Science Yale University Laboratory for Information and Decision Systems MIT arXiv:1604.00576v1 ...	8
Spike Event Based Learning in Neural Networks arXiv:1502.05777v1 [] 20 Feb 2015 J. A. Henderson, T. A. Gibson, J. Wiles Abstract A scheme is derived for learning connectivity in spiking neural networks. The scheme learns instantaneous firing rates that are conditional on the activity in other parts of the network. T...	9
arXiv:1711.02837v1 [stat.ML] 8 Nov 2017 Revealing structure components of the retina by deep learning networks Qi Yan, Zhaofei Yu, Feng Chen Center for Brain-Inspired Computing Research, Department of Automation, Tsinghua University {q-yan15,yuzf12}@mails.tsinghua.edu.cn chenfeng@mail.tsinghua.edu.cn Jian K. Liu Inst...	1
Addressing Expensive Multi-objective Games with Postponed Preference Articulation via Memetic Co-evolution Adam Żychowskia,∗, Abhishek Guptab , Jacek Mańdziuka , Yew Soon Ongb arXiv:1711.06763v1 [] 17 Nov 2017 a Faculty of Mathematics and Information Science, Warsaw University of Technology, Koszykowa 75, 00-662 W...	9
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 Algorithms for Scheduling Malleable Tasks arXiv:1501.04343v8 [cs.DC] 4 Feb 2018 Xiaohu Wu, and Patrick Loiseau Abstract—Due to the ubiquity of batch data processing in cloud computing, the related problems of scheduling malleable batch tasks have received ...	8
Distance-based Camera Network Topology Inference for Person Re-identification Yeong-Jun Cho and Kuk-Jin Yoon Computer Vision Laboratory, GIST, South Korea arXiv:1712.00158v1 [] 1 Dec 2017 {yjcho, kjyoon}@gist.ac.kr Abstract ID:337 1.23m/s In this paper, we propose a novel distance-based camera network topology inf...	1
Leveraging Time Series Data in Similarity Based Healthcare Predictive Models Leveraging Time Series Data in Similarity Based Healthcare Predictive Models: The Case of Early ICU Mortality Prediction Full Paper Mohammad Amin Morid David Eccles School of Business University of Utah amin.morid@business.utah.edu Olivia R...	2
1 The Spatial Outage Capacity of Wireless Networks arXiv:1708.05870v2 [] 23 Jan 2018 Sanket S. Kalamkar, Member, IEEE, and Martin Haenggi, Fellow, IEEE Abstract We address a fundamental question in wireless networks that, surprisingly, has not been studied before: what is the maximum density of concurrently active ...	7
Optimal power dispatch in networks of high-dimensional models of synchronous machines arXiv:1603.06688v1 [math.OC] 22 Mar 2016 Tjerk Stegink and Claudio De Persis and Arjan van der Schaft Abstract— This paper investigates the problem of optimal frequency regulation of multi-machine power networks where each synchrono...	3
Nominal Unification Revisited Christian Urban TU Munich, Germany urbanc@in.tum.de Nominal unification calculates substitutions that make terms involving binders equal modulo alphaequivalence. Although nominal unification can be seen as equivalent to Miller’s higher-order pattern unification, it has properties, such as...	6
EXTENSIONS OF THE BENSON-SOLOMON FUSION SYSTEMS arXiv:1701.06949v1 [] 24 Jan 2017 ELLEN HENKE AND JUSTIN LYND To Dave Benson on the occasion of his second 60th birthday Abstract. The Benson-Solomon systems comprise the only known family of simple saturated fusion systems at the prime two that do not arise as the fusi...	4
A generative model for sparse, evolving digraphs arXiv:1710.06298v1 [] 17 Oct 2017 Georgios Papoudakis and Philippe Preux and Martin Monperrus Abstract Generating graphs that are similar to real ones is an open problem, while the similarity notion is quite elusive and hard to formalize. In this paper, we focus on sp...	8
1 Use of a speed equation for numerical simulation of hydraulic fractures Alexander M. Linkov Institute for Problems of Mechanical Engineering, 61, Bol’shoy pr. V. O., Saint Petersburg, 199178, Russia Presently: Rzeszow University of Technology, ul. Powstancow Warszawy 8, Rzeszow, 35-959, Poland, e-mail: linkoval@prz....	5
Interference Alignment with Power Splitting Relays in Multi-User Multi-Relay Networks Man Chu∗ , Biao He† , Xuewen Liao∗ , Zhenzhen Gao∗ , and Shihua Zhu∗ ∗ Department arXiv:1705.06791v2 [] 23 May 2017 † of Information and Communication Engineering, Xi’an Jiaotong University, China The Center for Pervasive Communica...	7
arXiv:1702.03152v1 [cs.CC] 10 Feb 2017 A Variation of Levin Search for All Well-Defined Problems Fouad B. Chedid A’Sharqiyah University, Ibra, Oman f.chedid@asu.edu.om February 13, 2017 Abstract In 1973, L.A. Levin published an algorithm that solves any inversion problem π as quickly as the fastest algorithm p∗ comput...	8
arXiv:1510.00872v2 [math.NT] 9 Dec 2016 Compactifications of S-arithmetic quotients for the projective general linear group Takako Fukaya, Kazuya Kato, Romyar Sharifi December 12, 2016 Dedicated to Professor John Coates on the occasion of his 70th birthday Abstract Let F be a global field, let S be a nonempty finite ...	4
Learning to learn by gradient descent by gradient descent arXiv:1606.04474v2 [] 30 Nov 2016 Marcin Andrychowicz1 , Misha Denil1 , Sergio Gómez Colmenarejo1 , Matthew W. Hoffman1 , David Pfau1 , Tom Schaul1 , Brendan Shillingford1,2 , Nando de Freitas1,2,3 1 Google DeepMind 2 University of Oxford 3 Canadian Insti...	9
arXiv:1501.03411v4 [] 10 Dec 2015 PERINORMALITY – A GENERALIZATION OF KRULL DOMAINS NEIL EPSTEIN AND JAY SHAPIRO Abstract. We introduce a new class of integral domains, the perinormal domains, which fall strictly between Krull domains and weakly normal domains. We establish basic properties of the class, and in the ca...	0
Submitted to the Annals of Statistics arXiv: arXiv:1610.03944 RANK VERIFICATION FOR EXPONENTIAL FAMILIES By Kenneth Hung and William Fithian arXiv:1610.03944v2 [stat.ME] 3 Jul 2017 University of California, Berkeley Many statistical experiments involve comparing multiple population groups. For example, a public opin...	10
arXiv:1704.06398v2 [] 24 Jul 2017 Tail sums of Wishart and GUE eigenvalues beyond the bulk edge. Iain M. Johnstone∗ Stanford University and Australian National University July 26, 2017 Abstract Consider the classical Gaussian unitary ensemble of size N and the real Wishart ensemble WN (n, I). In the limits as N → ∞ an...	10
Event excitation for event-driven control and optimization of multi-agent systems Yasaman Khazaeni and Christos G. Cassandras Division of Systems Engineering and Center for Information and Systems Engineering Boston University, MA 02446 arXiv:1604.00691v1 [math.OC] 3 Apr 2016 yas@bu.edu,cgc@bu.edu Abstract— We consi...	3
arXiv:1610.03625v2 [] 8 Apr 2017 THE FSZ PROPERTIES OF SPORADIC SIMPLE GROUPS MARC KEILBERG Abstract. We investigate a possible connection between the F SZ properties of a group and its Sylow subgroups. We show that the simple groups G2 (5) and S6 (5), as well as all sporadic simple groups with order divisible by 56 a...	4
1 Multiple Right-Hand Side Techniques in Semi-Explicit Time Integration Methods for Transient Eddy Current Problems arXiv:1611.06721v2 [] 23 Sep 2017 Jennifer Dutiné∗ , Markus Clemens∗ , and Sebastian Schöps† ∗ Chair of Electromagnetic Theory, University of Wuppertal, 42119 Wuppertal, Germany † Graduate School CE,...	5
1 Deep Local Binary Patterns arXiv:1711.06597v1 [] 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 and sc...	1
International Journal on Soft Computing, Artificial Intelligence and Applications (IJSCAI), Vol.2, No.2, April 2013 STUDY OF Ε-SMOOTH SUPPORT VECTOR REGRESSION AND COMPARISON WITH Ε- SUPPORT VECTOR REGRESSION AND POTENTIAL SUPPORT VECTOR MACHINES FOR PREDICTION FOR THE ANTITUBERCULAR ACTIVITY OF OXAZOLINES AND OXAZOLE...	5
Provable and practical approximations for the degree distribution using sublinear graph samples∗ Talya Eden School of Computer Science, Tel Aviv University Tel Aviv, Israel talyaa01@gmail.com Shweta Jain University of California, Santa Cruz Santa Cruz, CA, USA sjain12@ucsc.edu arXiv:1710.08607v2 [cs.SI] 19 Jan 2018...	10
arXiv:1704.00699v2 [math.DS] 14 Jan 2018 FØLNER TILINGS FOR ACTIONS OF AMENABLE GROUPS CLINTON T. CONLEY, STEVE C. JACKSON, DAVID KERR, ANDREW S. MARKS, BRANDON SEWARD, AND ROBIN D. TUCKER-DROB Abstract. We show that every probability-measure-preserving action of a countable amenable group G can be tiled, modulo a nul...	4
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018 1 Capacity Scaling in MIMO Systems with General Unitarily Invariant Random Matrices arXiv:1306.2595v4 [] 5 Mar 2018 Burak Çakmak, Ralf R. Müller, Senior Member, IEEE, Bernard H. Fleury, Senior Member, IEEE Abstract—We investigate the capacity scaling of MIMO systems ...	7
1 One-pass Person Re-identification by Sketch Online Discriminant Analysis arXiv:1711.03368v1 [] 9 Nov 2017 Wei-Hong Li, Zhuowei Zhong, and Wei-Shi Zheng∗ Abstract—Person re-identification (re-id) is to match people across disjoint camera views in a multi-camera system, and re-id has been an important technology ap...	1
Logical Methods in Computer Science Vol. 5 (3:8) 2009, pp. 1–69 www.lmcs-online.org Submitted Published Jan. 2, 2008 Sep. 11, 2009 FULL ABSTRACTION FOR NOMINAL GENERAL REFERENCES NIKOS TZEVELEKOS Oxford University Computing Laboratory e-mail address: nikt@comlab.ox.ac.uk Abstract. Game semantics has been used with c...	6
Privacy-Enhanced Architecture for Occupancy-based HVAC Control Ruoxi Jia1 , Roy Dong2 , S. Shankar Sastry2 , Costas J. Spanos1 Department of Electrical Engineering and Computer Sciences University of California, Berkeley arXiv:1607.03140v1 [cs.CR] 11 Jul 2016 ruoxijia@berkeley.edu,roydong@eecs.berkeley.edu sastry@eec...	3
1 Fundamental Limits of Covert Communication over MIMO AWGN Channel Amr Abdelaziz and C. Emre Koksal Department of Electrical and Computer Engineering The Ohio State University Columbus, Ohio 43201 arXiv:1705.02303v4 [] 13 Mar 2018 Abstract Fundamental limits of covert communication have been studied for different m...	7
Some HCI Priorities for GDPR-Compliant Machine Learning Michael Veale University College London London, United Kingdom m.veale@ucl.ac.uk Reuben Binns Max Van Kleek University of Oxford Oxford, United Kingdom reuben.binns@cs.ox.ac.uk emax@cs.ox.ac.uk Abstract In this short paper, we consider the roles of HCI in enabli...	2
Discrete Mathematics and Theoretical Computer Science DMTCS vol. VOL:ISS, 2015, #NUM arXiv:1603.03019v1 [] 8 Mar 2016 Reducing the generalised Sudoku problem to the Hamiltonian cycle problem Michael Haythorpe1 1 Flinders University, Australia received 2016-03-09, revised xxxx-xx-xx, accepted yyyy-yy-yy. The genera...	8
ON LENGTHS OF HZ-LOCALIZATION TOWERS arXiv:1605.08198v2 [] 27 Jun 2016 SERGEI O. IVANOV AND ROMAN MIKHAILOV Abstract. In this paper, the HZ-length of different groups is studied. By definition, this is the length of HZ-localization tower or the length of transfinite lower central series of HZ-localization. It is prov...	4
Technical Report: Graph-Structured Sparse Optimization for Connected Subgraph Detection Feng Chen Computer Science Department University at Albany – SUNY Albany, USA fchen5@albany.edu arXiv:1609.09864v1 [] 30 Sep 2016 Baojian Zhou Computer Science Department University at Albany – SUNY Albany, USA bzhou6@albany.edu ...	8
A Linear Algorithm for Finding the Sink of Unique Sink Orientations on Grids arXiv:1709.08436v1 [] 25 Sep 2017 Xiaoming Sun, Jialin Zhang, Zhijie Zhang September 26, 2017 Abstract An orientation of a grid is called unique sink orientation (USO) if each of its nonempty subgrids has a unique sink. Particularly, the orig...	8
arXiv:1702.03150v1 [] 10 Feb 2017 Autocommuting probability of a finite group relative to its subgroups Parama Dutta and Rajat Kanti Nath∗ Department of Mathematical Sciences, Tezpur University, Napaam-784028, Sonitpur, Assam, India. Emails: parama@gonitsora.com and rajatkantinath@yahoo.com Abstract Let H ⊆ K be two...	4
arXiv:cs/0601038v1 [cs.LO] 10 Jan 2006 Under consideration for publication in Theory and Practice of Logic Programming 1 Constraint-based Automatic Verification of Abstract Models of Multithreaded Programs GIORGIO DELZANNO Dipartimento di Informatica e Scienze dell’Informazione, Università di Genova via Dodecaneso ...	2
R. Isea / Challenges and characterization of a Biological system on Grid Proceedings of the First EELA-2 Conference R. Mayo et al. (Eds.) CIEMAT 2009 © 2009 The authors. All rights reserved Challenges and characterization of a Biological system on Grid by means of the PhyloGrid application R. Isea1, E. Montes2, A.J. ...	5
1 Taxi Dispatch with Real-Time Sensing Data in Metropolitan Areas: A Receding Horizon Control Approach arXiv:1603.04418v1 [] 14 Mar 2016 Fei Miao, Student Member, IEEE, Shuo Han, Member, IEEE, Shan Lin, John A. Stankovic, Fellow, IEEE and ACM, Desheng Zhang, Sirajum Munir, Hua Huang, Tian He, and George J. Pappas Fe...	3
arXiv:1001.0641v1 [cs.LO] 5 Jan 2010 Least and Greatest Fixpoints in Game Semantics Pierre Clairambault pierre.clairambault@pps.jussieu.fr PPS — Université Paris 7 Abstract We show how solutions to many recursive arena equations can be computed in a natural way by allowing loops in arenas. We then equip arenas with w...	6
arXiv:1512.05105v1 [] 16 Dec 2015 INVARIANTS OF LINKAGE OF MODULES TONY J. PUTHENPURAKAL Abstract. Let (A, m) be a Gorenstein local ring and let M, N be two CohenMacaulay A-modules with M linked to N via a Gorenstein ideal q. Let L be another finitely generated A-module. We show that ExtiA (L, M ) = 0 for all i ≫ 0 if...	0
arXiv:1604.02691v1 [] 10 Apr 2016 On an algorithm for receiving Sudoku matrices Krasimir Yordzhev Faculty of Mathematics and Natural Sciences, South-West University Ivan Mihaylov 66, Blagoevgrad, 2700, Bulgaria E-mail: yordzhev@swu.bg Abstract This work examines the problem to describe an efficient algorithm for obtai...	8
Suprisal-Driven Zoneout arXiv:1610.07675v6 [cs.LG] 13 Dec 2016 Kamil Rocki Tomasz Kornuta IBM Research, San Jose, CA 95120, USA KMROCKI @ US . IBM . COM TKORNUT @ US . IBM . COM Tegan Maharaj Ecole Polytechnique de Montreal Abstract We propose a novel method of regularization for recurrent neural networks called s...	9
Event-triggered leader-following tracking control for multivariable multi-agent systems ⋆ arXiv:1603.04125v1 [] 14 Mar 2016 Yi Cheng a and V. Ugrinovskii a a School of Engineering and Information Technology, University of New South Wales at the Australian Defence Force Academy, Canberra, ACT 2600, Australia. Abstra...	3
CROSS-MODAL EMBEDDINGS FOR VIDEO AND AUDIO RETRIEVAL Didac Surı́s1 , Amanda Duarte2 , Amaia Salvador1 , Jordi Torres2 and Xavier Giró-i-Nieto1 1 2 Universitat Politècnica de Catalunya (UPC) Barcelona Supercomputing Center (BSC-CNS) arXiv:1801.02200v1 [cs.IR] 7 Jan 2018 ABSTRACT The increasing amount of online vid...	1
arXiv:1304.5833v1 [] 22 Apr 2013 ON THE EQUALITY OF ORDINARY AND SYMBOLIC POWERS OF IDEALS ALINE HOSRY, YOUNGSU KIM AND JAVID VALIDASHTI Abstract. We consider the following question concerning the equality of ordinary and symbolic powers of ideals. In a regular local ring, if the ordinary and symbolic powers of a one...	0
A Genetic Algorithm for solving Quadratic Assignment Problem (QAP) H. Azarbonyada, R. Babazadehb a b Department of Electrical and computers engineering, University of Tehran, Tehran, Iran, h.azarbonyad@ece.ut.ac.ir Department of industrial engineering, University of Tehran, Tehran, Iran, r.babazadeh@ut.ac.ir Abstrac...	9
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound∗. arXiv:1704.00807v1 [] 3 Apr 2017 Bernhard Haeupler Carnegie Mellon University haeupler@cs.cmu.edu Amirbehshad Shahrasbi Carnegie Mellon University shahrasbi@cs.cmu.edu Abstract We introduce synchronization strings, which p...	8
arXiv:1709.05061v1 [] 15 Sep 2017 Accelerating Dynamic Graph Analytics on GPUs Technical Report Version 2.0 Mo Sha, Yuchen Li, Bingsheng He and Kian-Lee Tan July 15, 2017 Contents 1 Introduction 1 2 Related Work 2.1 Graph Stream Processing . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2 Graph Analyti...	8
Durstewitz, Nonlinear State Space Model for Reconstructing Computational Dynamics, 11/02/16 Vers 02 Nov 2016 A State Space Approach for Piecewise‐Linear Recurrent Neural Networks for Reconstructing Nonlinear Dynamics from Neural Measurements Short title: Nonlinear State Space Model for Reconstructing Computational Dyn...	9
Published as a conference paper at ICLR 2018 arXiv:1705.07904v3 [cs.LG] 22 Feb 2018 S EMANTICALLY D ECOMPOSING THE L ATENT S PACES OF G ENERATIVE A DVERSARIAL N ETWORKS Chris Donahue Department of Music University of California, San Diego cdonahue@ucsd.edu Zachary C. Lipton Carnegie Mellon University Amazon AI zlipt...	9
arXiv:1705.07962v2 [cs.LG] 19 Sep 2017 pix2code: Generating Code from a Graphical User Interface Screenshot Tony Beltramelli UIzard Technologies Copenhagen, Denmark tony@uizard.io Abstract Transforming a graphical user interface screenshot created by a designer into computer code is a typical task conducted by a deve...	2
A Statistical Perspective on Inverse and Inverse Regression Problems Debashis Chatterjeea , Sourabh Bhattacharyaa,∗ arXiv:1707.06852v1 [stat.ME] 21 Jul 2017 a Interdisciplinary Statistical Research Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata - 700108, India Abstract Inverse problems, where in broad ...	10
Overcommitment in Cloud Services – Bin packing with Chance Constraints Maxime C. Cohen Google Research, New York, NY 10011, maxccohen@google.com Philipp W. Keller arXiv:1705.09335v1 [] 25 May 2017 Google, Mountain View, CA 94043, pkeller@google.com Vahab Mirrokni Google Research, New York, NY 10011, mirrokni@google...	8
The Complex Event Recognition Group Elias Alevizos Alexander Artikis Nikos Katzouris Georgios Paliouras Evangelos Michelioudakis arXiv:1802.04086v1 [] 12 Feb 2018 Institute of Informatics & Telecommunications, National Centre for Scientific Research (NCSR) Demokritos, Athens, Greece {alevizos.elias, a.artikis, nkat...	2
Proceedings of the 2007 Winter Simulation Conference S. G. Henderson, B. Biller, M.-H. Hsieh, J. Shortle, J. D. Tew, and R. R. Barton, eds. USING INTELLIGENT AGENTS TO UNDERSTAND MANAGEMENT PRACTICES AND RETAIL PRODUCTIVITY Peer-Olaf Siebers Uwe Aickelin Helen Celia Chris W. Clegg School of Computer Science, Automa...	5
Graph partitioning and a componentwise PageRank algorithm arXiv:1609.09068v1 [] 28 Sep 2016 Christopher Engström, Division of Applied Mathematics Education, Culture and Communication (UKK), Mälardalen University, christopher.engstrom@mdh.se Sergei Silvestrov Division of Applied Mathematics Education, Culture and Comm...	8
Slot Games for Detecting Timing Leaks of Programs Aleksandar S. Dimovski Faculty of Information-Communication Tech., FON University, Skopje, 1000, MKD aleksandar.dimovski@fon.edu.mk In this paper we describe a method for verifying secure information flow of programs, where apart from direct and indirect flows a secret...	6

Subsets and Splits

No community queries yet

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