Split (3)

train · 27.2k rows

text stringlengths 2.85k 2.55M	label int64 0 10
International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013 A COMPARATIVE STUDY ON REMOTE TRACKING OF PARKINSON’S DISEASE PROGRESSION USING DATA MINING METHODS Peyman Mohammadi1, Abdolreza Hatamlou 2 and Mohammad Masdari3 1 Department of Computer Engineering, Science an...	5
arXiv:1705.10998v1 [cs.AI] 31 May 2017 The Atari Grand Challenge Dataset Vitaly Kurin Visual Computing Institute RWTH Aachen University Aachen, Germany vitaliykurin@gmail.com Sebastian Nowozin, Katja Hofmann Machine Intelligence and Perception Group Microsoft Research Cambridge, UK {Sebastian.Nowozin, Katja.Hofmann}...	2
Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution Pim van der Hoorn1 , Gabor Lippner2 , and Dmitri Krioukov1,2,3 1 Northeastern University, Department of Physics Northeastern University, Department of Mathematics 3 Northeastern University, Departments of Electrical&Computer Engineering a...	10
arXiv:1208.4035v1 [cs.PL] 16 Aug 2012 QIRAL: A High Level Language for Lattice QCD Code Generation Denis Barthou Gilbert Grosdidier University of Bordeaux, Bordeaux, France denis.barthou@labri.fr Laboratoire de l’Accélerateur Linéaire, Orsay, France grosdid@in2p3.fr Michael Kruse Olivier Pene INRIA Saclay / AL...	6
Forward Stochastic Reachability Analysis for Uncontrolled Linear Systems using Fourier Transforms Abraham P. Vinod Electrical & Comp. Eng. University of New Mexico Albuquerque, NM 87131, USA arXiv:1610.04550v3 [cs.SY] 13 Feb 2017 aby.vinod@gmail.com Baisravan HomChaudhuri Electrical & Comp. Eng. University of New Me...	3
1 Stochastic Geometry Modeling and Analysis of Single- and Multi-Cluster Wireless Networks Seyed Mohammad Azimi-Abarghouyi, Behrooz Makki, Martin Haenggi, Fellow, IEEE, Masoumeh Nasiri-Kenari, Senior Member, IEEE, arXiv:1712.08784v1 [cs.IT] 23 Dec 2017 and Tommy Svensson, Senior Member, IEEE Abstract This paper dev...	7
arXiv:1211.7306v6 [math.AC] 23 Jun 2016 ON POLYNOMIALS WITH GIVEN HILBERT FUNCTION AND APPLICATIONS ALESSANDRA BERNARDI, JOACHIM JELISIEJEW, PEDRO MACIAS MARQUES, KRISTIAN RANESTAD Abstract. Using Macaulay’s correspondence we study the family of Artinian Gorenstein local algebras with fixed symmetric Hilbert function ...	0
1 arXiv:1511.05625v1 [cs.NE] 18 Nov 2015 MOEA/D-GM: Using probabilistic graphical models in MOEA/D for solving combinatorial optimization problems Murilo Zangari de Souza1, Roberto Santana2, Aurora Trinidad Ramirez Pozo1, Alexander Mendiburu2 1 DInf - Federal University of Paraná, CP: 19081, CEP 19031-970, Curitiba, ...	9
Towards Automatic Resource Bound Analysis for OCaml Jan Hoffmann Ankush Das Carnegie Mellon University Shu-Chun Weng Yale University November 2, 2016 Abstract This article presents a resource analysis system for OCaml programs. This system automatically derives worst-case resource bounds for higher-order polymorphic ...	6
Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D arXiv:1701.07204v3 [cs.DS] 30 Jun 2017 Allan Grønlund∗ Kasper Green Larsen† Jesper Sindahl Nielsen § Stefan Schneider Alexander Mathiasen‡ ¶ Mingzhou Song k Abstract The k-Means clustering problem on n points is NP-Hard for any dimension d ...	8
c Copyright notice. 1 Maximum Persistency via Iterative Relaxed Inference in Graphical Models arXiv:1508.07902v3 [cs.CV] 3 Feb 2017 Alexander Shekhovtsov, Paul Swoboda, and Bogdan Savchynskyy Abstract—We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial ...	8
APPROXIMATING GEODESICS VIA RANDOM POINTS arXiv:1711.06952v1 [math.PR] 19 Nov 2017 ERIK DAVIS AND SUNDER SETHURAMAN Abstract. Given a ‘cost’ functional F on paths γ in a domain D ⊂ Rd , in the R form F (γ) = 01 f (γ(t), γ̇(t))dt, it is of interest to approximate its minimum cost and geodesic paths. Let X1 , . . . , ...	10
An analysis of the SPARSEVA estimate for the finite sample data case ? Huong Ha a , James S. Welsh a , Cristian R. Rojas b , Bo Wahlberg b arXiv:1703.09351v1 [math.ST] 27 Mar 2017 a School b Department of Electrical Engineering and Computer Science, The University of Newcastle, Australia of Automatic Control and AC...	10
1 Low-Complexity Sub-band Digital Predistortion for Spurious Emission Suppression in Noncontiguous Spectrum Access arXiv:1607.02249v2 [cs.IT] 19 Aug 2016 Mahmoud Abdelaziz, Student Member, IEEE, Lauri Anttila, Member, IEEE, Chance Tarver, Student Member, IEEE, Kaipeng Li, Student Member, IEEE, Joseph R. Cavallaro, F...	3
Characteristic Matrices and Trellis Reduction for Tail-Biting Convolutional Codes Masato Tajima, Senior Member, IEEE arXiv:1705.03982v2 [cs.IT] 23 May 2017 Abstract Basic properties of a characteristic matrix for a tail-biting convolutional code are investigated. A tail-biting convolutional code can be regarded as a ...	7
arXiv:1705.00985v1 [cs.DS] 2 May 2017 Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees David Durfee∗ John Peebles† Richard Peng‡ Anup B. Rao§ May 3, 2017 Abstract We show variants of spectral sparsification routines can preserve the total spanning tr...	8
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain∗ Sang Won Bae1 , Matias Korman2 , Joseph S.B. Mitchell3 , Yoshio Okamoto4 , Valentin Polishchuk5 , and Haitao Wang6 arXiv:1512.07160v2 [cs.CG] 9 Nov 2016 1 2 3 4 5 6 Kyonggi University, Suwon, South Korea. swbae@kgu.ac.kr Tohoku University, Sendai, ...	8
MMSE PRECODER FOR MASSIVE MIMO USING 1-BIT QUANTIZATION Ovais Bin Usman, Hela Jedda, Amine Mezghani and Josef A. Nossek arXiv:1706.08717v1 [cs.IT] 27 Jun 2017 Institute for Circuit Theory and Signal Processing Technische Universität München, 80290 Munich, Germany Email:{hela.jedda, josef.a.nossek}@tum.de ABSTRACT W...	7
On using Tra er Driver for External Dynami Pro ess Observation ⋆ (extended abstra t) arXiv:cs/0701106v1 [cs.PL] 17 Jan 2007 Pierre Deransart Inria Ro quen ourt, BP 105, 78153 Le Chesnay Cedex, Fran e Pierre.Deransartinria.fr Abstra t One is interested here in the observation of dynami pro esses starting from the...	2
Sample Efficient Policy Search for Optimal Stopping Domains arXiv:1702.06238v2 [cs.AI] 24 May 2017 Karan Goel Carnegie Mellon University kgoel93@gmail.com Christoph Dann Carnegie Mellon University cdann@cdann.net Abstract Optimal stopping problems consider the question of deciding when to stop an observation-genera...	2
Exact Learning of Lightweight Description Logic Ontologies Exact Learning of Lightweight Description Logic Ontologies Boris Konev konev@liverpool.ac.uk Department of Computer Science University of Liverpool, United Kingdom arXiv:1709.07314v1 [cs.LG] 20 Sep 2017 Carsten Lutz clu@informatik.uni-bremen.de Departmen...	2
FLIC: Fast Linear Iterative Clustering with Active Search Jiaxing Zhao1 Bo Ren1∗ arXiv:1612.01810v2 [cs.CV] 21 Nov 2017 1 Qibin Hou1 Nankai University Abstract In this paper, we reconsider the clustering problem for image over-segmentation from a new perspective. We propose a novel search algorithm named “active ...	1
An asymptotically optimal indirect approach to continuous-time system identification arXiv:1803.08449v1 [cs.SY] 22 Mar 2018 Rodrigo A. González, Cristian R. Rojas and James S. Welsh Abstract— The indirect approach to continuous-time system identification consists in estimating continuous-time models by first determi...	3
1 When data mining meets optimization: A case study on the quadratic assignment problem arXiv:1708.05214v2 [cs.DM] 7 Oct 2017 Yangming Zhou, Jin-Kao Hao∗ , and Béatrice Duval Abstract—This paper presents a hybrid approach called frequent pattern based search that combines data mining and optimization. The proposed ...	8
Divergence, Entropy, Information An Opinionated Introduction to Information Theory Phil Chodrow 1 1 arXiv:1708.07459v1 [cs.IT] 24 Aug 2017 MIT Operations Research Center pchodrow@mit.edu https://philchodrow.github.io/ August 25, 2017 Information theory is a mathematical theory of learning with deep connections wit...	7
On the topological dimension of the Gromov boundaries of some hyperbolic Out(FN )-graphs Mladen Bestvina, Camille Horbez and Richard D. Wade arXiv:1610.02115v1 [math.GR] 7 Oct 2016 October 10, 2016 Abstract We give upper bounds, linear in the rank, to the topological dimensions of the Gromov boundaries of the interse...	4
Accepted in the IEEE Transactions on Cognitive and Developmental Systems (TCDS), 2017 Seamless Integration and Coordination of Cognitive Skills in Humanoid Robots: A Deep Learning Approach Jungsik Hwang and Jun Tani Abstract This study investigates how adequate coordination among the different cognitive processes o...	2
MINIMUM DISTANCE FUNCTIONS OF COMPLETE INTERSECTIONS arXiv:1601.07604v4 [math.AC] 24 Oct 2017 JOSÉ MARTÍNEZ-BERNAL, YURIKO PITONES, AND RAFAEL H. VILLARREAL Abstract. We study the minimum distance function of a complete intersection graded ideal in a polynomial ring with coefficients in a field. For graded ideals o...	7
arXiv:1604.00795v1 [math.AC] 4 Apr 2016 Méthodes Matricielles Introduction à la Complexité Algébrique ABDELJAOUED Jounaı̈di Maı̂tre Assistant Université de Tunis LOMBARDI Henri Maı̂tre de Conférences Université de Franche-Comté, Besançon Version mise à jour en, avril 2012 Avant-Propos L’algèbre linéair...	0
1 Coded Caching Schemes with Reduced Subpacketization from Linear Block Codes arXiv:1706.00101v3 [cs.IT] 19 Feb 2018 Li Tang and Aditya Ramamoorthy Department of Electrical and Computer Engineering Iowa State University Ames, IA 50010 Emails:{litang, adityar}@iastate.edu Abstract—Coded caching is a technique that g...	7
Journal of Machine Learning Research X (2017) XX-XX Submitted 12/17; Published XX/XX f -Divergence constrained policy improvement arXiv:1801.00056v1 [cs.LG] 29 Dec 2017 Boris Belousov Jan Peters belousov@ias.tu-darmstadt.de peters@ias.tu-darmstadt.de Department of Computer Science Technische Universität Darmstad...	2
EULERIAN GRADED D-MODULES arXiv:1210.8402v2 [math.AC] 15 Jul 2016 LINQUAN MA AND WENLIANG ZHANG Abstract. Let R = K[x1 , . . . , xn ] with K a field of arbitrary characteristic and D be the ring of differential operators over R. Inspired by Euler formula for homogeneous polynomials, we introduce a class of graded D-...	0
Free Applicative Functors Paolo Capriotti Ambrus Kaposi University of Nottingham, United Kingdom University of Nottingham, United Kingdom pvc@cs.nott.ac.uk auk@cs.nott.ac.uk Applicative functors [6] are a generalisation of monads. Both allow the expression of effectful computations into an otherwise pure language...	6
arXiv:1709.04673v2 [cs.SY] 10 Dec 2017 Conditions for Stability and Convergence of Set-Valued Stochastic Approximations: Applications to Approximate Value and Fixed point Iterations Arunselvan Ramaswamy ∗ Dept. of Electrical Engineering and Information Technology Paderborn University Paderborn - 33908, Germany. Shal...	3
1 Sensor Selection for Target Tracking in Wireless Sensor Networks with Uncertainty Nianxia Cao, Student Member, IEEE, Sora Choi, arXiv:1510.01993v1 [cs.SY] 7 Oct 2015 Engin Masazade, Member, IEEE, Pramod K. Varshney, Fellow, IEEE Abstract In this paper, we propose a multiobjective optimization framework for the se...	3
A norm knockout method on indirect reciprocity to reveal indispensable norms∗ Hitoshi Yamamoto1,* , Isamu Okada2,+ , Satoshi Uchida3,+ , and Tatsuya Sasaki4,+ arXiv:1703.03943v1 [physics.soc-ph] 11 Mar 2017 1 Rissho University, Department of Business Administration, Tokyo, 141-8602, Japan University, Department of B...	9
ON FEEBLY COMPACT SHIFT-CONTINUOUS TOPOLOGIES ON THE SEMILATTICE expn λ arXiv:1702.06105v2 [math.GN] 5 May 2017 OLEG GUTIK AND OLEKSANDRA SOBOL Abstract. We study feebly compact topologies τ on the semilattice (expn λ, ∩) such that (expn λ, τ ) is a semitopological semilattice and prove that for any shift-continuous ...	4
Unit Interval Editing is Fixed-Parameter Tractable Yixin Cao∗ arXiv:1504.04470v2 [cs.DS] 31 Dec 2016 Abstract Given a graph G and integers k1 , k2 , and k3 , the unit interval editing problem asks whether G can be transformed into a unit interval graph by at most k1 vertex deletions, k2 edge deletions, and k3 edge ad...	8
arXiv:1709.07565v1 [cs.CV] 22 Sep 2017 NOVEL EVALUATION METRICS FOR SEAM CARVING BASED IMAGE RETARGETING Tam V. Nguyen Guangyu Gao Department of Computer Science University of Dayton Email: tamnguyen@udayton.edu School of Software Beijing Institute of Technology Email: guangyugao@bit.edu.cn ABSTRACT Image retarget...	1
The inflation technique solves completely the classical inference problem Miguel Navascués1 and Elie Wolfe2 1 Institute for Quantum Optics and Quantum Information (IQOQI) Vienna, Austrian Academy of Sciences, Boltzmanngasse 3, 1090 Vienna, Austria 2 Perimeter Institute for Theoretical Physics, 31 Caroline St. N, Wate...	10
June 2015 (revised September 2015) Report LIDS - 3176 Incremental Aggregated Proximal and Augmented Lagrangian Algorithms arXiv:1509.09257v2 [cs.SY] 4 Nov 2015 Dimitri P. Bertsekas† Abstract We consider minimization of the sum of a large number of convex functions, and we propose an incremental aggregated version o...	3
arXiv:1511.00954v1 [math.CO] 3 Nov 2015 EFFECTIVE INVARIANT THEORY OF PERMUTATION GROUPS USING REPRESENTATION THEORY NICOLAS BORIE Abstract. Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce th...	0
Zero-Shot Deep Domain Adaptation Kuan-Chuan Peng, Ziyan Wu, Jan Ernst Siemens Corporate Technology Princeton, NJ, USA arXiv:1707.01922v2 [cs.CV] 16 Nov 2017 {kuanchuan.peng, ziyan.wu, jan.ernst}@siemens.com Abstract The existing methods of domain adaptation (DA) work under the assumption that the task-relevant targe...	1
EVENT-TRIGGERED CONTROL OF INFINITE-DIMENSIONAL SYSTEMS∗ arXiv:1801.05521v1 [math.OC] 17 Jan 2018 MASASHI WAKAIKI AND HIDEKI SANO† Abstract. We consider the event-triggered control of continuous-time linear infinite-dimensional systems. We show that an event trigger that measures the difference of a control input lea...	3
arXiv:1711.07068v1 [cs.CV] 19 Nov 2017 Diverse and Accurate Image Description Using a Variational Auto-Encoder with an Additive Gaussian Encoding Space Liwei Wang Alexander G. Schwing Svetlana Lazebnik {lwang97, aschwing, slazebni}@illinois.edu University of Illinois at Urbana-Champaign Abstract This paper explores ...	1
Happy Travelers Take Big Pictures: A Psychological Study with Machine Learning and Big Data Xuefeng Liang, Lixin Fan† , Yuen Peng Loh‡ , Yang Liu, Song Tong ‡ IST, Graduate School of Informatics, Kyoto University, 606-8501 Kyoto, Japan † Nokia Technologies, Tampere 33100, Finland Centre of Image and Signal Processing,...	1
Practical combinations of repetition-aware data structures∗ Djamal Belazzougui1 , Fabio Cunial2 , Travis Gagie3,4 , Nicola Prezza5 , and Mathieu Raffinot6 1 2 CERIST, Algeria. Max Planck Institute of Molecular Cell Biology and Genetics, Dresden, Germany. Department of Computer Science, University of Helsinki, Finland....	8
The Power of Data Reduction for Matching George B. Mertzios1 , André Nichterlein∗1,2 , and Rolf Niedermeier2 arXiv:1609.08879v2 [cs.DS] 16 Mar 2017 1 School of Engineering and Computing Sciences, Durham University, UK, george.mertzios@durham.ac.uk 2 Institut für Softwaretechnik und Theoretische Informatik, TU Berl...	8
Provable quantum state tomography via non-convex methods Anastasios Kyrillidis,1, ∗ Amir Kalev,2, † Dohuyng Park,3, ‡ Srinadh Bhojanapalli,4, § Constantine Caramanis,5, ¶ and Sujay Sanghavi5, ∗∗ 1 arXiv:1711.02524v3 [quant-ph] 19 Nov 2017 IBM T. J. Watson Research Center 2 University of Maryland 3 Facebook 4 Toyota T...	8
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion Amir Abboud∗ Keren Censor-Hillel† Seri Khoury† Christoph Lenzen‡ arXiv:1711.01623v3 [cs.DS] 13 Dec 2017 December 14, 2017 Abstract We introduce a novel lower bound technique for distributed graph algorithms under bandwidth li...	8
TIME PARALLEL GRAVITATIONAL COLLAPSE SIMULATION ANDREAS KREIENBUEHL arXiv:1509.01572v3 [gr-qc] 28 Dec 2016 Center for Computational Sciences and Engineering, Lawrence Berkeley National Laboratory, 1 Cyclotron Road, Berkeley CA 94720, United States of America PIETRO BENEDUSI Institute of Computational Science, Facul...	5
Toward Depth Estimation Using Mask-Based Lensless Cameras M. Salman Asif arXiv:1711.03527v1 [cs.CV] 9 Nov 2017 Department of Electrical and Computer Engineering University of California, Riverside Email: sasif@ece.ucr.edu Abstract—Recently, coded masks have been used to demonstrate a thin form-factor lensless camera,...	1
M ODULAR C ONTINUAL L EARNING IN A U NIFIED V ISUAL E NVIRONMENT Blue Sheffer Department of Psychology Stanford University Stanford, CA 94305 bsheffer@stanford.edu arXiv:1711.07425v2 [cs.LG] 12 Dec 2017 Kevin T. Feigelis Department of Physics Stanford Neurosciences Institute Stanford University Stanford, CA 94305 fei...	2
Smooth backfitting of proportional hazards – A new approach projecting survival data Munir Hiabu Cass Business School, City University London, U.K. arXiv:1707.04622v1 [math.ST] 14 Jul 2017 E-mail: Munir.Hiabu.1@cass.city.ac.uk Enno Mammen Heidelberg University, Germany E-mail: mammen@math.uni-heidelberg.de Marı́a Do...	10
To appear in Theory and Practice of Logic Programming. 1 arXiv:1210.2297v2 [cs.PL] 9 Oct 2012 Diagrammatic confluence for Constraint Handling Rules∗ Rémy Haemmerlé Technical University of Madrid Abstract Confluence is a fundamental property of Constraint Handling Rules (CHR) since, as in other rewriting formalism...	6
1 Design Exploration of Hybrid CMOS-OxRAM Deep Generative Architectures arXiv:1801.02003v1 [cs.ET] 6 Jan 2018 Vivek Parmar, Member, IEEE, and Manan Suri, Member, IEEE Indian Institute of Technology-Delhi, Hauz Khas, New Delhi-110016, email: manansuri@ee.iitd.ac.in Abstract—Deep Learning and its applications have ga...	9
Sympiler: Transforming Sparse Matrix Codes by Decoupling Symbolic Analysis arXiv:1705.06575v1 [cs.PL] 18 May 2017 Kazem Cheshmi Adobe Research Cambridge, MA, US kamil@adobe.com Michelle Mills Strout Maryam Mehri Dehnavi University of Arizona Tucson, AZ, US mstrout@cs.arizona.edu ABSTRACT Sympiler is a domain-spe...	6
arXiv:1506.00716v1 [cs.CE] 2 Jun 2015 Tackling Exascale Software Challenges in Molecular Dynamics Simulations with GROMACS Szilárd Páll1,2,† Carsten Kutzner3 Mark James Abraham1,2,† Berk Hess1,2 Erik Lindahl1,2,4 Feb 12, 2015 1 Science for Life Laboratory, Stockholm and Uppsala, 171 21 Stockholm, Swe- den, 2 Dep...	5
Feeding Hand-Crafted Features for Enhancing the Performance of Convolutional Neural Networks arXiv:1801.07848v1 [cs.CV] 24 Jan 2018 Sepidehsadat Hosseini Seoul National University sepid@ispl.snu.ac.kr Seok Hee Lee Seoul Nat’l Univ. seokheel@snu.ac.kr Abstract Nam Ik Cho Seoul National University nicho@snu.ac.kr a...	1
arXiv:1508.01290v1 [math.AC] 6 Aug 2015 TORIC RINGS, INSEPARABILITY AND RIGIDITY MINA BIGDELI, JÜRGEN HERZOG AND DANCHENG LU Abstract. Let K be a field, H an affine semigroup and R = K[H] its toric ring over K. In this paper we give an explicit description of the ZH-graded components of the cotangent module T 1 (R) w...	0
A New Approach to Probabilistic Programming Inference arXiv:1507.00996v2 [stat.ML] 9 Jul 2015 Frank Wood Department of Engineering University of Oxford Jan Willem van de Meent Vikash Mansinghka Department of Statistics Computer Science & AI Lab Columbia University Massachusetts Institute of Technology Abstract We i...	6
From Clarity to Efficiency for Distributed Algorithms ∗ Yanhong A. Liu Scott D. Stoller Bo Lin arXiv:1412.8461v4 [cs.PL] 12 Mar 2017 Computer Science Department, Stony Brook University, Stony Brook, NY 11794, USA {liu,stoller,bolin}@cs.stonybrook.edu Abstract 1. Introduction This article describes a very high-le...	6
Ternary Neural Networks with Fine-Grained Quantization arXiv:1705.01462v3 [cs.LG] 30 May 2017 Naveen Mellempudi1 , Abhisek Kundu1 , Dheevatsa Mudigere1 , Dipankar Das1 , Bharat Kaul1 , and Pradeep Dubey2 1 Parallel Computing Lab, Intel Labs, Bangalore, India Parallel Computing Lab, Intel Labs, Santa Clara, CA 2 Ab...	9
arXiv:1605.02306v1 [math.GT] 8 May 2016 CONJUGATION-INVARIANT NORMS ON THE COMMUTATOR SUBGROUP OF THE INFINITE BRAID GROUP MITSUAKI KIMURA Abstract. In this paper, we give a proof of the result of Brandenbursky and Kȩdra which says that the commutator subgroup of the infinite braid group admits stably unbounded norm...	4
INITIALIZATION OF MULTILAYER FORECASTING ARTIFICIAL NEURAL NETWORKS V.V. Bochkarev and Yu.S. Maslennikova Kazan (Volga Region) Federal University vbochkarev@mail.ru, YuliaMsl@gmail.com Abstract In this paper, a new method was developed for initialising artificial neural networks predicting dynamics of time series. I...	9
arXiv:1802.07810v1 [cs.AI] 21 Feb 2018 Manipulating and Measuring Model Interpretability Forough Poursabzi-Sangdeh Daniel G. Goldstein Jake M. Hofman forough.poursabzisangdeh@colorado.edu dgg@microsoft.com jmh@microsoft.com University of Colorado Boulder Microsoft Research Microsoft Research Jennifer Wortman ...	2
1 Recent Advances in Zero-shot Recognition arXiv:1710.04837v1 [cs.CV] 13 Oct 2017 Yanwei Fu, Tao Xiang, Yu-Gang Jiang, Xiangyang Xue, Leonid Sigal, and Shaogang Gong Abstract—With the recent renaissance of deep convolution neural networks, encouraging breakthroughs have been achieved on the supervised recognition t...	2
1 On the reduction of differential inclusions and Lyapunov stability arXiv:1703.07071v4 [cs.SY] 23 Jan 2018 Rushikesh Kamalapurkar, Warren E. Dixon, and Andrew R. Teel Abstract—In this paper, locally Lipschitz regular functions are utilized to identify and remove infeasible directions from differential inclusions. ...	3
An Algorithmic Framework for Labeling Network Maps? Jan-Henrik Haunert1 and Benjamin Niedermann2 1 arXiv:1505.00164v2 [cs.CG] 30 Dec 2015 2 University of Osnabrück, Germany Karlsruhe Institute of Technology, Germany Abstract. Drawing network maps automatically comprises two challenging steps, namely laying out the...	8
Sailfish: Alignment-free Isoform Quantification from arXiv:1308.3700v1 [q-bio.GN] 16 Aug 2013 RNA-seq Reads using Lightweight Algorithms Rob Patro1 , Stephen M. Mount2 , and Carl Kingsford1 1 Lane Center for Computational Biology, School of Computer Science Carnegie Mellon University 2 Department of Cell Biology an...	5
Multiscale model reduction for shale gas transport in fractured media I. Y. Akkutlu ∗ Yalchin Efendiev† Maria Vasilyeva‡ arXiv:1507.00113v1 [cs.CE] 1 Jul 2015 July 2, 2015 Abstract In this paper, we develop a multiscale model reduction technique that describes shale gas transport in fractured media. Due to the po...	5
arXiv:1711.04177v1 [math.GT] 11 Nov 2017 COUNTING PROBLEMS IN GRAPH PRODUCTS AND RELATIVELY HYPERBOLIC GROUPS ILYA GEKHTMAN, SAMUEL J. TAYLOR, AND GIULIO TIOZZO Abstract. We study properties of generic elements of groups of isometries of hyperbolic spaces. Under general combinatorial conditions, we prove that loxodro...	4
E XPLORING THE S PACE OF B LACK - BOX ATTACKS D EEP N EURAL N ETWORKS arXiv:1712.09491v1 [cs.LG] 27 Dec 2017 Arjun Nitin Bhagoji ∗ Department of Electrical Engineering Princeton University ON Warren He, Bo Li & Dawn Song EECS Department University of California, Berkeley A BSTRACT Existing black-box attacks on dee...	1
Collaborative Large-Scale Dense 3D Reconstruction with Online Inter-Agent Pose Optimisation Stuart Golodetz∗ Victor A. Prisacariu Tommaso Cavallari∗ David W. Murray Nicholas A. Lord∗ Philip H. S. Torr arXiv:1801.08361v1 [cs.CV] 25 Jan 2018 Department of Engineering Science, University of Oxford {smg,tommaso,nicklor...	1
EXTERIOR AND SYMMETRIC POWERS OF MODULES FOR CYCLIC 2-GROUPS FRANK HIMSTEDT AND PETER SYMONDS arXiv:1510.02370v1 [math.RT] 8 Oct 2015 Abstract. We prove a recursive formula for the exterior and symmetric powers of modules for a cyclic 2-group. This makes computation straightforward. Previously, a complete description...	0
Identification of functionally related enzymes by learning-to-rank methods arXiv:1405.4394v1 [cs.LG] 17 May 2014 Michiel Stock, Thomas Fober, Eyke Hüllermeier, Serghei Glinca, Gerhard Klebe, Tapio Pahikkala, Antti Airola, Bernard De Baets, Willem Waegeman ∗ Abstract Enzyme sequences and structures are routinely use...	5
> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 A Generalized-Impedance Based Stability Criterion for Three-Phase Grid-Connected Voltage Source Converters Huanhai Xin, Ziheng Li, Wei Dong, Zhen Wang, and Leiqi Zhang  Abstract—The output impedance matrices of three-phase grid...	3
arXiv:1610.02523v2 [math.GR] 7 Jun 2017 THE kR -PROPERTY ON FREE TOPOLOGICAL GROUPS FUCAI LIN, SHOU LIN, AND CHUAN LIU Abstract. A space X is called a kR -space, if X is Tychonoff and the necessary and sufficient condition for a real-valued function f on X to be continuous is that the restriction of f on each compact ...	4
1 Binary Hypothesis Testing with Byzantine Sensors: Fundamental Trade-off Between Security and Efficiency arXiv:1707.09592v3 [cs.IT] 19 Jan 2018 Xiaoqiang Ren∗ , Jiaqi Yan∗ , and Yilin Mo∗† Abstract This paper studies binary hypothesis testing based on measurements from a set of sensors, a subset of which can be com...	7
A1 -TYPE SUBGROUPS CONTAINING REGULAR UNIPOTENT ELEMENTS arXiv:1706.05212v1 [math.GR] 16 Jun 2017 TIMOTHY C. BURNESS AND DONNA M. TESTERMAN Abstract. Let G be a simple exceptional algebraic group of adjoint type over an algebraically closed field of characteristic p > 0 and let X = PSL2 (p) be a subgroup of G contai...	4
BOIJ-SÖDERBERG DECOMPOSITIONS OF LEX-SEGMENT IDEALS SEMA GÜNTÜRKÜN arXiv:1404.0118v2 [math.AC] 20 Aug 2015 A BSTRACT. Boij-Söderberg theory describes the scalar multiples of Betti diagrams of graded modules over a polynomial ring as a linear combination of pure diagrams with positive coefficients. There are a fe...	0
1 Offline signature authenticity verification through unambiguously connected skeleton segments arXiv:1711.03082v1 [cs.CV] 8 Nov 2017 Jugurta Montalvão, Luiz Miranda, and Jânio Canuto Abstract—A method for offline signature verification is presented in this paper. It is based on the segmentation of the signature sk...	1
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 Difficulty Adjustable and Scalable Constrained Multi-objective Test Problem Toolkit arXiv:1612.07603v2 [cs.NE] 16 Sep 2017 Zhun Fan, Senior Member, IEEE, Wenji Li, Xinye Cai, Hui Li, Caimin Wei, Qingfu Zhang, Fellow, IEEE, Kalyanmoy Deb, Fellow, IEEE, and ...	9
arXiv:1707.08644v2 [math.ST] 24 Oct 2017 Sharpening Jensen’s Inequality J. G. Liao and Arthur Berg Division of Biostatistics and Bioinformatics Penn State University College of Medicine October 26, 2017 Abstract This paper proposes a new sharpened version of the Jensen’s inequality. The proposed new bound is simple a...	10
Stochastic k-Server: How Should Uber Work?* Sina Dehghani ∗† Soheil Ehsani arXiv:1705.05755v2 [cs.DS] 30 May 2017 Vahid Liaghat ‡ ∗† MohammadTaghi HajiAghayi Saeed Seddighin ∗† ∗† Abstract In this paper we study a stochastic variant of the celebrated k-server problem. In the kserver problem, we are required t...	8
arXiv:1711.06735v1 [math.GR] 17 Nov 2017 ENDOMORPHISMS OF REGULAR ROOTED TREES INDUCED BY THE ACTION OF POLYNOMIALS ON THE RING Zd OF d-ADIC INTEGERS ELSAYED AHMED AND DMYTRO SAVCHUK Abstract. We show that every polynomial in Z[x] defines an endomorphism of the dary rooted tree induced by its action on the ring Zd of...	4
Fully Decentralized Policies for Multi-Agent Systems: An Information Theoretic Approach Roel Dobbe∗, David Fridovich-Keil∗and Claire Tomlin † August 1, 2017 arXiv:1707.06334v2 [cs.SY] 29 Jul 2017 Abstract 1 Learning cooperative policies for multi-agent systems is often challenged by partial observability and a la...	7
Permutation monoids and MB-homogeneous structures arXiv:1802.04166v1 [math.GR] 12 Feb 2018 Thomas D. H. Coleman1, David M. Evans2, Robert D. Gray3,4 February 13, 2018 Abstract In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking ou...	4
Published in Theory and Practice of Logic Programming 11(4–5), 611–627 (2011) (27th Int’l. Conference on Logic Programming (ICLP’11) Special Issue) 1 SUNNY-CP and the MiniZinc Challenge arXiv:1706.08627v3 [cs.AI] 5 Jul 2017 Roberto Amadini Department of Computing and Information Systems, The University of Melbourne...	2
arXiv:1705.10342v1 [cs.AI] 29 May 2017 Deep Learning for Ontology Reasoning Patrick Hohenecker, Thomas Lukasiewicz Department of Computer Science University of Oxford Oxford, United Kingdom {patrick.hohenecker, thomas.lukasiewicz}@cs.ox.ac.uk Abstract In this work, we present a novel approach to ontology reasoning t...	2
Minimax Optimal Procedures for Locally Private Estimation John C. Duchi† jduchi@stanford.edu Michael I. Jordan∗ jordan@stat.berkeley.edu arXiv:1604.02390v2 [math.ST] 14 Nov 2017 Stanford University† Stanford, CA 94305 Martin J. Wainwright∗ wainwrig@berkeley.edu University of California, Berkeley∗ Berkeley, CA 9472...	10
Active network management for electrical distribution systems: problem formulation, benchmark, and approximate solution Quentin Gemine* , Damien Ernst* , and Bertrand Cornélusse* arXiv:1405.2806v6 [cs.SY] 1 Jun 2016 * {qgemine@ulg.ac.be, dernst@ulg.ac.be, bertrand.cornelusse@ulg.ac.be}, Department of Electrical Eng...	5
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
EXISTENTIALLY GENERATED SUBFIELDS OF LARGE FIELDS SYLVY ANSCOMBE arXiv:1710.03353v1 [math.LO] 9 Oct 2017 Abstract. We study subfields of large fields which are generated by infinite existentially definable subsets. We say that such subfields are existentially generated. Let L be a large field of characteristic expone...	0
arXiv:1703.01780v5 [cs.NE] 8 Jan 2018 Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results Antti Tarvainen The Curious AI Company tarvaina@cai.fi Harri Valpola The Curious AI Company harri@cai.fi Abstract The recently proposed Temporal Ensembling ha...	9
Experimental and causal view on information integration in autonomous agents arXiv:1606.04250v3 [cs.AI] 13 Mar 2018 Philipp Geiger1 and Katja Hofmann2 and Bernhard Schölkopf 3 Abstract. The amount of digitally available but heterogeneous information about the world is remarkable, and new technologies such as self-dr...	2
THE ORDER OF DOMINANCE OF A MONOMIAL IDEAL arXiv:1802.04863v1 [math.AC] 13 Feb 2018 GUILLERMO ALESANDRONI Abstract. Let S be a polynomial ring in n variables over a field, and let M be a monomial ideal of S. We introduce the notion of order of dominance of S/M , denoted odom(S/M ), which has many similarities with t...	0
Learning with Opponent-Learning Awareness Jakob N. Foerster2,† Richard Y. Chen1,† Maruan Al-Shedivat4 jakob.foerster@cs.ox.ac.uk richardchen@openai.com alshedivat@cs.cmu.edu Shimon Whiteson2 Pieter Abbeel3 Igor Mordatch1 shimon.whiteson@cs.ox.ac.uk pieter@openai.com mordatch@openai.com arXiv:1709.04326v2 [c...	2
Streaming Graph Challenge: Stochastic Block Partition Edward Kao, Vijay Gadepally, Michael Hurley, Michael Jones, Jeremy Kepner, Sanjeev Mohindra, Paul Monticciolo, Albert Reuther, Siddharth Samsi, William Song, Diane Staheli, Steven Smith arXiv:1708.07883v1 [cs.DC] 25 Aug 2017 MIT Lincoln Laboratory, Lexington, MA ...	8
DOI: 10.1109/TPWRD.2017.2688356 Published in: IEEE Transactions on Power Delivery 1 Online Calibration of Phasor Measurement Unit Using Density-Based Spatial Clustering Xinan Wang, Student Member, IEEE, Di Shi, Senior Member, IEEE, Zhiwei Wang, Member, IEEE, Chunlei Xu, Qibing Zhang, Xiaohu Zhang, Member, IEEE, Zhe Y...	3

Subsets and Splits

No community queries yet

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