text stringlengths 2.85k 2.55M | label int64 0 10 |
|---|---|
A Probabilistic Theory of Deep Learning
arXiv:1504.00641v1 [stat.ML] 2 Apr 2015
Ankit B. Patel, Tan Nguyen, Richard G. Baraniuk
Department of Electrical and Computer Engineering
Rice University
{abp4, mn15, richb}@rice.edu
April 2, 2015
A grand challenge in machine learning is the development of computational algorit... | 9 |
Latent Factor Analysis of Gaussian Distributions
under Graphical Constraints
arXiv:1801.03481v3 [cs.IT] 20 Jan 2018
Md Mahmudul Hasan, Shuangqing Wei, Ali Moharrer
Abstract—In this paper, we explored the algebraic structures
of solution spaces for Gaussian latent factor analysis when the
population covariance matrix ... | 7 |
A Programming Model and Runtime System for
Significance-Aware Energy-Efficient Computing
Vassilis Vassiliadis1
Spyros Lalis5
1,2,4,5,6
Konstantinos Parasyris2
Charalambos Chalios3
Christos D. Antonopoulos4
Nikolaos Bellas6
Hans Vandierendonck7
Dimitrios S. Nikolopoulos8
Electrical and Computer Eng. Dept.
University o... | 6 |
Topology Learning of Radial Dynamical Systems with Latent Nodes
arXiv:1803.02793v1 [cs.SY] 7 Mar 2018
Saurav Talukdar1 , Deepjyoti Deka2 , Michael Chertkov2 and Murti Salapaka3
Abstract— In this article, we present a method to reconstruct
the topology of a partially observed radial network of linear dynamical system... | 3 |
Facial Emotion Recognition using Min-Max
Similarity Classifier
Olga Krestinskaya and Alex Pappachen James
arXiv:1801.00451v1 [cs.CV] 1 Jan 2018
School of Engineering, Nazarbayev University, Astana
www.biomicrosystems.info/alex
Email: apj@ieee.org
Abstract—Recognition of human emotions from the imaging
templates is u... | 1 |
How to be correct, lazy
and efficient ?
C. Recanati
Université Paris 13,
av. JB. Clément,
1. Lambdix and the semantic problems
93430, Villetaneuse,
France
of Lisp
This paper is an introduction to
Lambdix, a lazy Lisp interpreter
implemented at the Research Laboratory
of the University of Paris XI (Laboratoire
de Re... | 6 |
Outage Performance Analysis of Multicarrier Relay
Selection for Cooperative Networks
Shuping Dang, Justin P. Coon, Gaojie Chen and David E. Simmons
arXiv:1708.05868v1 [cs.IT] 19 Aug 2017
Department of Engineering Science, University of Oxford, Oxford, UK, OX1 3PJ
Email: {shuping.dang, justin.coon, gaojie.chen, david.... | 7 |
Improved Submatrix Maximum Queries in Monge Matrices
Pawel Gawrychowski1 , Shay Mozes2? , and Oren Weimann3∗
1
MPII, gawry@mpi-inf.mpg.de
IDC Herzliya, smozes@idc.ac.il
University of Haifa, oren@cs.haifa.ac.il
2
arXiv:1307.2313v4 [cs.DS] 12 Oct 2017
3
Abstract. We present efficient data structures for submatrix max... | 8 |
Computational Optimal Transport: Complexity by Accelerated Gradient
Descent Is Better Than by Sinkhorn’s Algorithm
Pavel Dvurechensky 1 Alexander Gasnikov 2 3 Alexey Kroshnin 2 3
arXiv:1802.04367v1 [cs.DS] 12 Feb 2018
Abstract
We analyze two algorithms for approximating the
general optimal transport (OT) distance bet... | 8 |
1
Analysis of Network Robustness for Finite Sized
Wireless Sensor Networks
arXiv:1609.06888v1 [cs.SY] 22 Sep 2016
Sateeshkrishna Dhuli, Chakravarthy Gopi, Yatindra Nath Singh, Senior Member, IEEE
Abstract—Studying network robustness for wireless sensor
networks(WSNs) is an exciting topic of research as sensor nodes... | 3 |
BPS/CFT CORRESPONDENCE:
arXiv:1512.05388v2 [hep-th] 2 Jan 2016
NON-PERTURBATIVE
DYSON-SCHWINGER EQUATIONS
AND qq-CHARACTERS
NIKITA NEKRASOV
Abstract. We study symmetries of quantum field theories involving topologically distinct sectors of the field space. To exhibit these symmetries we define special gauge
invariant... | 0 |
Generating Reflectance Curves from sRGB Triplets *
0F
Scott Allen Burns
University of Illinois at Urbana-Champaign (scottb@illinois.edu)
Overview
I present several algorithms for generating a reflectance curve from a specified sRGB triplet,
written for a general audience. Although there are an infinite number of refle... | 1 |
Equivalence of Lattice Orbit Polytopes
FRIEDER LADISCH AND ACHILL SCHÜRMANN
arXiv:1703.01152v2 [math.MG] 31 Jan 2018
Dedicated to Jörg M. Wills on the occasion of his 80th birthday
A b s t r ac t . Let G be a finite permutation group acting on Rd by permuting
coordinates. A core point (for G) is an integral vector z ... | 4 |
arXiv:1803.03901v1 [stat.ME] 11 Mar 2018
Piecewise Convex Function Estimation:
Representations, Duality and Model Selection
Kurt S. Riedel
Courant Institute of Mathematical Sciences
New York University
New York, New York 10012-1185
Abstract
We consider spline estimates which preserve prescribed piecewise convex proper... | 10 |
arXiv:1612.06117v2 [math.GR] 24 Jun 2017
CELLULAR AUTOMATA, DUALITY AND SOFIC GROUPS
LAURENT BARTHOLDI
Abstract. We produce for arbitrary non-amenable group G and field K a
non-pre-injective, surjective linear cellular automaton. This answers positively
Open Problem (OP-14) in Ceccherini-Silberstein and Coornaert’s mo... | 4 |
arXiv:1611.01595v1 [math.ST] 5 Nov 2016
Power Computations for Intervention
Analysis
A. Ian McLeod and Evelyn R. Vingilis
Department of Statistical and Actuarial Sciences,
The University of Western Ontario
London, Ontario N6A 5B7
aimcleod@uwo.ca
Department of Family Medicine,
University of Western Ontario
London, Onta... | 10 |
GADTs meet subtyping
Gabriel Scherer and Didier Rémy
arXiv:1301.2903v1 [cs.PL] 14 Jan 2013
INRIA, Rocquencourt⋆
Abstract. While generalized algebraic datatypes (GADTs) are now considered well-understood, adding them to a language with a notion of
subtyping comes with a few surprises. What does it mean for a GADT
pa... | 6 |
Logical Methods in Computer Science
Vol. 8 (2:01) 2012, pp. 1–35
www.lmcs-online.org
Submitted
Published
Jul. 13, 2011
Apr. 6, 2012
EXTENDED INITIALITY FOR TYPED ABSTRACT SYNTAX
BENEDIKT AHRENS
Laboratoire J.-A. Dieudonné, Université Nice Sophia Antipolis, Parc Valrose, 06108 Nice, France
e-mail address: ahrens@unic... | 6 |
BIVARIATE REPRESENTATION AND CONJUGACY CLASS
ZETA FUNCTIONS ASSOCIATED TO UNIPOTENT GROUP
SCHEMES
arXiv:1802.04440v1 [math.GR] 13 Feb 2018
PAULA MACEDO LINS DE ARAUJO
Abstract. We introduce two bivariate zeta functions associated to unipotent
group schemes over rings of integers of number fields. These zeta function... | 4 |
arXiv:1603.05683v1 [math.GR] 17 Mar 2016
Journal of Algebraic Systems
Vol. XX, No XX, (201X), pp XX-XX
ON RELATIVE CENTRAL EXTENSIONS AND
COVERING PAIRS
A. POURMIRZAEI∗ , M. HASSANZADEH AND B. MASHAYEKHY
Abstract. Let (G, N ) be a pair of groups. In this article, first we
construct a relative central extension for th... | 4 |
arXiv:1711.05085v2 [math.ST] 11 Apr 2018
The mixability of elliptical distributions with
supermodular functions
Xiaoqian Zhang Chuancun Yin
School of Statistics, Qufu Normal University
Shandong 273165, China
e-mail: ccyin@mail.qfnu.edu.cn
April 12, 2018
ABSTRACT The concept of φ-complete mixability and φ-joint mixab... | 10 |
A multifactor RSA-like scheme with fast decryption
based on Rédei rational functions over the Pell
hyperbola
arXiv:1709.00696v1 [cs.IT] 3 Sep 2017
Emanuele Bellini
DarkMatter LLC, UAE
Nadir Murru
University of Turin, Italy
Abstract
We propose a generalization of an RSA-like scheme based on Rédei rational
function... | 7 |
arXiv:1609.00820v3 [math.AT] 10 Nov 2016
Doctoral Thesis
CLASSIFYING SPACES FOR
KNOTS
New bridges between knot theory
and algebraic number theory
Federico William Pasini
Supervisor:
Professor Thomas Stefan Weigel
A thesis submitted in partial fulfillment of the requirements
for the degree of Philosophiae Doctor in M... | 4 |
P ERSONALIZING D IALOGUE AGENTS :
I HAVE A DOG , DO YOU HAVE PETS TOO ?
Saizheng Zhang, Emily Dinan, Jack Urbanek, Arthur Szlam, Douwe Kiela, & Jason Weston
Facebook AI Research
arXiv:1801.07243v1 [cs.AI] 22 Jan 2018
A BSTRACT
Chit-chat models are known to have several problems: they lack specificity, do not
display ... | 2 |
1
Resource Allocation for Downlink NOMA Systems:
Key Techniques and Open Issues
arXiv:1801.00121v1 [cs.IT] 30 Dec 2017
S. M. Riazul Islam, Ming Zeng, Octavia A. Dobre and Kyung-Sup Kwak
Abstract—This article presents advances in resource allocation
(RA) for downlink non-orthogonal multiple access (NOMA)
systems, fo... | 7 |
Open Transactions on Shared Memory
Marino Miculan
Marco Peressotti
Andrea Toneguzzo
marino.miculan@uniud.it
marco.peressotti@uniud.it
toneguzzo.andrea@spes.uniud.it
arXiv:1503.09097v1 [cs.PL] 31 Mar 2015
Laboratory of Models and Applications of Distributed Systems
Department of Mathematics and Computer Science
U... | 6 |
NOTES ON EXTREMAL AND TAME VALUED FIELDS
arXiv:1407.3759v2 [math.LO] 11 Jul 2016
SYLVY ANSCOMBE AND FRANZ-VIKTOR KUHLMANN
Abstract. We extend the characterization of extremal valued fields given
in [2] to the missing case of valued fields of mixed characteristic with perfect
residue field. This leads to a complete ch... | 0 |
arXiv:1701.07775v1 [q-bio.NC] 26 Jan 2017
A Forward Model at Purkinje Cell Synapses
Facilitates Cerebellar Anticipatory Control
Ivan Herreros-Alonso
SPECS lab
Universitat Pompeu Fabra
Barcelona, Spain
ivan.herreros@upf.edu
Xerxes D. Arsiwalla
SPECS lab
Universitat Pompeu Fabra
Barcelona, Spain
Paul F.M.J. Verschure... | 3 |
A Characterization of Scale Invariant Responses
in Enzymatic Networks
arXiv:1202.5332v1 [cs.SY] 23 Feb 2012
Maja Skataric
Department of Electrical Engineering, Rutgers University, Piscataway, NJ, USA
Eduardo Sontag∗
Department of Mathematics, Rutgers University, Piscataway, NJ, USA
November 9, 2017
Running head: Sca... | 5 |
The DFS Fused Lasso: Linear-Time Denoising over General
Graphs
Oscar Hernan Madrid Padilla1
oscar.madrid@utexas.edu
James Sharpnack2
jsharpna@gmail.com
arXiv:1608.03384v3 [math.ST] 1 Mar 2017
James Scott1,3
james.scott@mccombs.utexas.edu
Ryan J. Tibshirani4,5
ryantibs@stat.cmu.edu
1
Department of Statistics and D... | 10 |
Real-time Prediction of Intermediate-Horizon
Automotive Collision Risk
Blake Wulfe
Stanford University
Stanford, CA
wulfebw@stanford.edu
arXiv:1802.01532v1 [cs.CV] 5 Feb 2018
Rory Hartong-Redden
The Allstate Corporation
Northbrook, IL
rory.hartong-redden@allstate.com
Sunil Chintakindi
The Allstate Corporation
Nor... | 1 |
Two-Scale Topology Optimization with Microstructures
arXiv:1706.03189v1 [cs.CE] 10 Jun 2017
BO ZHU, MÉLINA SKOURAS, DESAI CHEN, WOJCIECH MATUSIK, MIT CSAIL
Fig. 1. Our two-scale topology optimization framework allows to optimize continuous material properties mapping to printable microstructures (left) to
fabricate... | 5 |
QUOTIENTS OF TRIANGULATED CATEGORIES AND
EQUIVALENCES OF BUCHWEITZ, ORLOV AND AMIOT–GUO–KELLER
arXiv:1702.04475v2 [math.RT] 22 Aug 2017
OSAMU IYAMA AND DONG YANG
Abstract. We give a simple sufficient condition for a Verdier quotient T /S of a triangulated
category T by a thick subcategory S to be realized inside of T... | 0 |
arXiv:1407.3508v2 [math.GR] 26 Jun 2017
Hyperbolicity of relative free splitting
and free factor complexes
Michael Handel and Lee Mosher
∗
February 7, 2018
1
Introduction
Masur and Minsky in their papers [MM99, MM00] introduced a hierarchy of connected
simplicial complexes associated to a finite type surface S: a... | 4 |
NEGATIVE CURVES OF SMALL GENUS ON SURFACES
arXiv:1105.1154v6 [math.GT] 5 Jun 2016
TED CHINBURG* AND MATTHEW STOVER**
Abstract. Let X be an irreducible smooth geometrically integral projective surface over
a field. In this paper we give an effective bound in terms of the Neron–Severi rank ρ(X)
of X for the number of i... | 4 |
arXiv:1709.02435v1 [cs.AI] 7 Sep 2017
An Analysis of ISO 26262: Using Machine
Learning Safely in Automotive Software
Rick Salay
Rodrigo Queiroz
Krzysztof Czarnecki
University of Waterloo
ON, Canada
Email: rsalay@gsd.uwaterloo.ca
University of Waterloo
ON, Canada
Email: rqueiroz@gsd.uwaterloo.ca
University of Wate... | 2 |
MultiParametric Statistical Method for Estimation of Accumulated
Fatigue by Sensors in Ordinary Gadgets
Nikita Gordienko,
PhysicalMathematical Lyceum 142, Kyiv, Ukraine
assasin.nik@gmail.com
Abstract
The new method is proposed to monitor the level of currently accumulated
fatigue and estimate it by the several statis... | 5 |
PRICING VIRTUAL PATHS WITH QUALITY-OF-SERVICE
GUARANTEES AS BUNDLE DERIVATIVES
arXiv:cs/0106028v1 [cs.NI] 12 Jun 2001
LARS RASMUSSON
Abstra t. We des ribe a model of a ommuni ation network that allows us
to pri e omplex network servi es as nan ial derivative ontra ts based on
the spot pri e of the apa ity in individ... | 5 |
arXiv:1703.07970v1 [math.AC] 23 Mar 2017
The strong Lefschetz property of monomial
complete intersections in two variables
Lisa Nicklasson
Abstract
In this paper we classify the monomial complete intersection algebras,
in two variables, and of positive characteristic, which has the strong Lefschetz property. Together ... | 0 |
arXiv:1509.01763v5 [cs.CR] 30 Jun 2017
Implementing Support for Pointers to Private Data in a
General-Purpose Secure Multi-Party Compiler
Yihua Zhang
Department of Computer Science and Engineering
University of Notre Dame
yzhang16@nd.edu
Marina Blanton
Department of Computer Science and Engineering
State University of... | 6 |
Vehicle Routing with Subtours
Stephan Held1, Jochen Könemann2 and Jens Vygen1
1
arXiv:1801.04991v1 [cs.DS] 15 Jan 2018
2
Research Institute for Discrete Mathematics, University of Bonn
Department of Combinatorics & Optimization, University of Waterloo
held@dm.uni-bonn.de, jochen@uwaterloo.ca, vygen@dm.uni-bonn.de
... | 8 |
arXiv:1301.3545v2 [cs.LG] 16 Mar 2013
Metric-Free Natural Gradient for Joint-Training of
Boltzmann Machines
Guillaume Desjardins, Razvan Pascanu, Aaron Courville and Yoshua Bengio
Département d’informatique et de recherche opérationnelle
Université de Montréal
Abstract
This paper introduces the Metric-Free Natura... | 9 |
1
Coding Method for Parallel Iterative Linear Solver
arXiv:1706.00163v3 [cs.IT] 5 Jun 2017
Yaoqing Yang, Student Member, IEEE, Pulkit Grover, Senior Member, IEEE, and Soummya Kar
Abstract—Computationally intensive distributed and parallel
computing is often bottlenecked by a small set of slow workers
known as strag... | 7 |
Frequency Distribution of Error Messages
David Pritchard
arXiv:1509.07238v1 [cs.SE] 24 Sep 2015
Center for Education in Math and Computing, University of Waterloo, Canada ∗
dagpritchard@uwaterloo.ca
Abstract
Which programming error messages are the most common?
We investigate this question, motivated by writing erro... | 6 |
1
User Association and Resource Allocation in
Unified Non-Orthogonal Multiple Access
Enabled Heterogeneous Ultra Dense Networks
arXiv:1801.08198v1 [cs.IT] 24 Jan 2018
Zhijin Qin, Member, IEEE, Xinwei Yue, Student Member, IEEE, Yuanwei Liu, Member, IEEE,
Zhiguo Ding, Senior Member, IEEE, and Arumugam Nallanathan, Fell... | 7 |
arXiv:1711.06961v1 [math.AC] 19 Nov 2017
SYSTEMS OF SETS OF LENGTHS OF PUISEUX MONOIDS
FELIX GOTTI
Abstract. In this paper we study the system of sets of lengths of non-finitely generated atomic Puiseux monoids (a Puiseux monoid is an additive submonoid of Q≥0 ).
We begin by presenting a BF-monoid M with full system o... | 0 |
Tight Approximation Bounds for the Seminar
Assignment Problem ⋆
Amotz Bar-Noy and George Rabanca
arXiv:1610.04785v1 [cs.DS] 15 Oct 2016
Department of Computer Science, Graduate Center, CUNY, New York, USA
Abstract. The seminar assignment problem is a variant of the generalized assignment problem in which items have ... | 8 |
arXiv:1709.00734v2 [math.GR] 6 Nov 2017
Worst-case approximability of functions on finite
groups by endomorphisms and affine maps
Alexander Bors∗
November 7, 2017
Abstract
For a finite set M and functions f, g : M → M , say that g approximates f to
the degree N if and only if f (x) = g(x) for at least N elements x ∈ ... | 4 |
High-Accuracy Real-Time
Whole-Body Human Motion Tracking
Based on Constrained Nonlinear Kalman Filtering
Jannik Steinbringa , Christian Manderyb , Nikolaus Vahrenkampb , Tamim Asfourb ,
Uwe D. Hanebecka
a
Intelligent Sensor-Actuator-Systems Laboratory (ISAS)
Institute for Anthropomatics and Robotics
Karlsruhe Institut... | 3 |
arXiv:1705.03980v2 [math.AC] 25 Jan 2018
AUSLANDER MODULES
PEYMAN NASEHPOUR
Dedicated to my father, Maestro Nasrollah Nasehpour
Abstract. In this paper, we introduce the notion of Auslander modules, inspired from Auslander’s zero-divisor conjecture (theorem) and give some interesting results for these modules. We als... | 0 |
1
Capturing the Future by Replaying the Past
Functional Pearl
arXiv:1710.10385v1 [cs.PL] 28 Oct 2017
JAMES KOPPEL, MIT
ARMANDO SOLAR-LEZAMA, MIT
Delimited continuations are the mother of all monads! So goes the slogan inspired by Filinski’s 1994 paper, which showed
that delimited continuations can implement any mona... | 6 |
Linear State Estimation via 5G C-RAN Cellular
Networks using Gaussian Belief Propagation
arXiv:1710.08671v2 [cs.IT] 2 Feb 2018
Mirsad Cosovic, Dejan Vukobratovic, Vladimir Stankovic
Abstract—Machine-type communications and large-scale
information processing architectures are among key
(r)evolutionary enhancements of... | 7 |
L2 –INVISIBILITY OF SYMMETRIC OPERAD GROUPS
arXiv:1407.7450v3 [math.AT] 2 Apr 2016
WERNER THUMANN
Abstract. We show a homological result for the class of planar or symmetric
operad groups: We show that under certain conditions, group (co)homology
of such groups with certain coefficients vanishes in all dimensions, pr... | 4 |
arXiv:1603.04212v1 [math.GR] 14 Mar 2016
AMENABILITY AND PARADOXICAL DECOMPOSITIONS FOR
PSEUDOGROUPS AND FOR DISCRETE METRIC SPACES
TULLIO CECCHERINI-SILBERSTEIN, ROSTISLAV I. GRIGORCHUK,
AND PIERRE DE LA HARPE
Abstract. This is an expostion of various aspects of amenability and paradoxical decompositions for groups, ... | 4 |
Reachability problems for PAMs
⋆
Oleksiy Kurganskyy1 and Igor Potapov2
1
Institute of Applied Mathematics and Mechanics, NAS of Ukraine
Department of Computer Science, University of Liverpool, UK
arXiv:1510.04121v1 [cs.NA] 14 Oct 2015
2
Abstract. Piecewise affine maps (PAMs) are frequently used as a reference mod... | 8 |
Improved Hardness for Cut, Interdiction,
and Firefighter Problems
arXiv:1607.05133v1 [cs.CC] 18 Jul 2016
Euiwoong Lee∗
Computer Science Department
Carnegie Mellon University
Pittsburgh, PA 15213.
Abstract
We study variants of the classic s-t cut problem and prove the following improved hardness
results assuming the ... | 8 |
Submitted to the Bernoulli
arXiv: arXiv:1407.0335
arXiv:1407.0335v3 [math.ST] 23 Jan 2017
A general approach to posterior contraction
in nonparametric inverse problems
BARTEK KNAPIK1,* and JEAN-BERNARD SALOMOND2,**
1
Department of Mathematics, Vrije Universiteit Amsterdam, De Boelelaan 1081, 1081 HV Amsterdam,
The N... | 10 |
The Robust Reading Competition Annotation and
Evaluation Platform
Dimosthenis Karatzas, Lluis Gómez Marçal Rusiñol
arXiv:1710.06617v1 [cs.CV] 18 Oct 2017
Computer Vision Centre, Universitat Autonoma de Barcelona, Barcelona, Spain;
{dimos, lgomez, marcal}@cvc.uab.es
Abstract—The ICDAR Robust Reading Competition (R... | 1 |
arXiv:1703.10959v3 [cs.DC] 22 Dec 2017
Parallelism, Concurrency and Distribution in Constraint Handling
Rules: A Survey
THOM FRÜHWIRTH
University of Ulm, Germany
December 25, 2017
Abstract
Constraint Handling Rules (CHR) is both an effective concurrent declarative programming language and a versatile computational lo... | 6 |
1
Integrated PV Charging of EV Fleet Based on
Dynamic Energy Prices and Offer of Reserves
Gautham Ram Chandra Mouli, Student Member, IEEE, Mahdi Kefayati, Member, IEEE,
Ross Baldick, Fellow, IEEE, Pavol Bauer, Senior Member, IEEE
Fig. 1. Design of solar powered EV charging station
PEVrc
xe+t,v
Power (W)
Abstrac... | 3 |
Alternating Direction Graph Matching
D. Khuê Lê-Huu1, 2
1
Nikos Paragios1, 2, 3
CentraleSupélec, Université Paris-Saclay
2
Inria
3
TheraPanacea
arXiv:1611.07583v4 [cs.CV] 23 Feb 2018
{khue.le, nikos.paragios}@centralesupelec.fr
Abstract
Graph matching has been an active research topic in the
computer visi... | 1 |
A Reduction for Optimizing Lattice Submodular Functions with
Diminishing Returns
arXiv:1606.08362v1 [cs.DS] 27 Jun 2016
Alina Ene
∗
Huy L. Nguyen†
June 28, 2016
Abstract
A function f : ZE
+ → R+ is DR-submodular if it satisfies f (x+χi )−f (x) ≥ f (y+χi )−f (y) for
all x ≤ y, i ∈ E. Recently, the problem of maxim... | 8 |
Prophet Inequalities Made Easy:
Stochastic Optimization by Pricing Non-Stochastic Inputs
arXiv:1612.03161v2 [cs.GT] 9 Jul 2017
Paul Dütting∗
Michal Feldman†
Thomas Kesselheim‡
Brendan Lucier§
July 11, 2017
Abstract
We present a general framework for stochastic online maximization problems with combinatorial fea... | 8 |
Computational homogenization of non-stationary
transport processes in masonry structures
arXiv:1110.2055v1 [cs.CE] 10 Oct 2011
Jan Sýkoraa , Tomáš Krejčı́a , Jaroslav Kruisa , Michal Šejnohaa,∗
a
Department of Mechanics, Faculty of Civil Engineering, Czech Technical University in
Prague, Thákurova 7, 166 29 Pr... | 5 |
arXiv:1611.02801v1 [math.AC] 9 Nov 2016
The resultants of quadratic binomial complete
intersections
T. Harima, Niigata University
Department of Mathematics Education, Niigata, 950-2181 Japan
∗
A. Wachi, Hokkaido University of Education
Department of Mathematics,
Kushiro, 085-8580 Japan
J. Watanabe, Tokai University
... | 0 |
SEMI-IMPLICIT TIME INTEGRATION OF ATMOSPHERIC FLOWS
WITH CHARACTERISTIC-BASED FLUX PARTITIONING∗
arXiv:1510.05751v2 [cs.CE] 14 Apr 2016
DEBOJYOTI GHOSH† ‡ AND EMIL M. CONSTANTINESCU† §
Abstract. This paper presents a characteristic-based flux partitioning for the semi-implicit time
integration of atmospheric flows. N... | 5 |
1
Continuous-Domain Solutions of Linear Inverse
Problems with Tikhonov vs. Generalized TV
Regularization
arXiv:1802.01344v1 [cs.IT] 5 Feb 2018
Harshit Gupta, Julien Fageot, and Michael Unser
Abstract—We consider linear inverse problems that are formulated in the continuous domain. The object of recovery is a
functi... | 7 |
A CHARACTERIZATION OF LOCALLY QUASI-UNMIXED RINGS
arXiv:1607.07641v1 [math.AC] 26 Jul 2016
SIMIN MOLLAMAHMOUDI, ADELEH AZARI AND REZA NAGHIPOUR∗
Abstract. Let I¯ denote the integral closure of an ideal in a Noetherian ring R. The
main result of this paper asserts that R is locally quasi-unmixed if and only if, the
to... | 0 |
Derived supersymmetries of determinantal varieties
Steven V Sam
arXiv:1207.3309v1 [math.RT] 13 Jul 2012
July 13, 2012
Abstract
We show that the linear strands of the Tor of determinantal varieties in spaces of symmetric
and skew-symmetric matrices are irreducible representations for the periplectic (strange) Lie
sup... | 0 |
CSVideoNet: A Real-time End-to-end Learning Framework for
High-frame-rate Video Compressive Sensing
arXiv:1612.05203v5 [cs.CV] 28 Jan 2018
Kai XU
Fengbo Ren
School of Computing, Informatics, and Decision Systems Engineering
Arizona State University, Tempe AZ 85281
{kaixu, renfengbo}@asu.edu
Abstract
This paper addre... | 1 |
EMBEDDINGS OF CANONICAL MODULES AND RESOLUTIONS OF
CONNECTED SUMS
arXiv:1704.03072v1 [math.AC] 10 Apr 2017
ELA CELIKBAS, JAI LAXMI, AND JERZY WEYMAN
Abstract. For an ideal Im,n generated by all square-free monomials of degree m in a
polynomial ring R with n variables, we obtain a specific embedding of a canonical mod... | 0 |
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 [cs.DS] 25 May 2017
Google, Mountain View, CA 94043, pkeller@google.com
Vahab Mirrokni
Google Research, New York, NY 10011, mirrokni@g... | 8 |
Approximating Cycles in Directed Graphs:
Fast Algorithms for Girth and Roundtrip Spanners
Jakub Pachocki
arXiv:1611.00721v1 [cs.DS] 2 Nov 2016
Roei Tov
§
∗
Liam Roditty
†
Aaron Sidford
Virginia Vassilevska Williams
‡
¶
Abstract
The girth of a graph, i.e. the length of its shortest cycle, is a fundamental gra... | 8 |
COMPUTATION OF EXTENDED ROBUST KALMAN FILTER FOR REAL-TIME
ATTITUDE AND POSITION ESTIMATION
Gaurav R. Yengera∗, Roberto S. Inoue†, Mundla Narasimhappa‡, Marco H. Terra‡
∗
Department of Electrical Engineering, Indian Institute of Technology (Banaras Hindu University),
Varanasi and also with Department of Electrical Eng... | 3 |
Design, Generation, and Validation of
Extreme Scale Power-Law Graphs
Jeremy Kepner1 , Siddharth Samsi1 , William Arcand1 , David Bestor1 , Bill Bergeron1 , Tim Davis2 ,
Vijay Gadepally1 , Michael Houle1 , Matthew Hubbell1 , Hayden Jananthan1,3 , Michael Jones1 , Anna Klein1 ,
Peter Michaleas1 , Roger Pearce4 , Lauren M... | 8 |
What
the
F-‐measure
doesn’t
measure…
Features,
F laws,
F allacies
a nd
F ixes
David M.W. Powers, Beijing University of Technology, China & Flinders University, Australia
Technical Report KIT-14-001 Computer Science, Engineering & Mathematics, Flinders University
The F-measure or F-... | 9 |
1
Trajectory Optimization for Completion Time
Minimization in UAV-Enabled Multicasting
arXiv:1708.06478v1 [cs.IT] 22 Aug 2017
Yong Zeng, Member, IEEE, Xiaoli Xu, and Rui Zhang, Fellow, IEEE
Abstract—This paper studies an unmanned aerial vehicle
(UAV)-enabled multicasting system, where a UAV is dispatched
to dissemi... | 7 |
LOCAL METHODS FOR BLOCKS OF FINITE SIMPLE GROUPS
arXiv:1712.08913v1 [math.RT] 24 Dec 2017
MARC CABANES
Abstract. We review old and new results about the modular representation theory of finite reductive groups with a strong emphasis on local methods. This includes subpairs, Brauer’s Main Theorems, fusion, Rickard equ... | 4 |
Rate Optimal Binary Linear Locally Repairable Codes with
Small Availability
Swanand Kadhe and Robert Calderbank
arXiv:1701.02456v2 [cs.IT] 14 Sep 2017
swanand.kadhe@tamu.edu, robert.calderbank@duke.edu
A locally repairable code with availability has the property that every code symbol can be recovered
from multiple,... | 7 |
On Variants of Network Flow Stability
Young-San Lin1 and Thanh Nguyen2
1
arXiv:1710.03091v1 [cs.GT] 9 Oct 2017
2
Computer Science Department, Purdue University, e-mail: lin532@purdue.com
Krannert School of Management, Purdue University, e-mail: nguye161@purdue.edu
Abstract. We present a variant of the stable flow p... | 8 |
Networked SIS Epidemics with Awareness
arXiv:1607.02502v2 [cs.SI] 12 Jul 2016
Keith Paarporn1 , Ceyhun Eksin1,2 , Joshua S. Weitz2,3 , Jeff S. Shamma1,4
Abstract—We study an SIS epidemic process over a static
contact network where the nodes have partial information about
the epidemic state. They react by limiting th... | 3 |
Are You Talking to Me? Reasoned Visual Dialog Generation
through Adversarial Learning
Qi Wu1 , Peng Wang2 , Chunhua Shen1 , Ian Reid1 , and Anton van den Hengel1
arXiv:1711.07613v1 [cs.CV] 21 Nov 2017
1
Australian Centre for Robotic Vision, The University of Adelaide, Australia
2
Northwestern Polytechnical Universit... | 1 |
Stability and Transparency Analysis of a Bilateral Teleoperation in
Presence of Data Loss
arXiv:1711.03605v1 [cs.SY] 9 Nov 2017
A. Bakhshi, H.A. Talebi, A.A. Suratgar, and M. Abdeetedal
Abstract— This paper presents a novel approach for stability
and transparency analysis for bilateral teleoperation in the
presence o... | 3 |
Proof of Control of a UAV and a UGV Cooperating
to Manipulate an Object
arXiv:1602.08987v2 [cs.SY] 1 Mar 2016
Tam Nguyen, Emanuele Garone
Abstract—This paper focuses on the control of a system composed of an Unmanned Aerial Vehicle (UAV) and an Unmanned
Ground Vehicle (UGV) which cooperate to manipulate an object.
T... | 3 |
Deep Learning for Automatic Stereotypical Motor Movement Detection using
Wearable Sensors in Autism Spectrum Disorders
Nastaran Mohammadian Rad 1,2,3,∗, Seyed Mostafa Kia4,5 , Calogero Zarbo1 , Twan van Laarhoven2 , Giuseppe
Jurman1 , Paola Venuti6 , Elena Marchiori2 , Cesare Furlanello1
Fondazione Bruno Kessler, Via S... | 9 |
Testing Ising Models
Constantinos Daskalakis∗
EECS, MIT
costis@mit.edu
Nishanth Dikkala†
EECS, MIT
nishanthd@csail.mit.edu
Gautam Kamath‡
EECS, MIT
g@csail.mit.edu
arXiv:1612.03147v4 [cs.DS] 30 Oct 2017
November 1, 2017
Abstract
Given samples from an unknown multivariate distribution p, is it possible to distingui... | 10 |
arXiv:1410.0602v1 [quant-ph] 2 Oct 2014
A probabilistic evolutionary optimization approach to
compute quasiparticle braids
Roberto Santana
Ross B. McDonald
Helmut G. Katzgraber
Intelligent Systems Group
Dept. of Computer Science
and Artificial Intelligence
University of the Basque
Country (UPV/EHU)
Dept. of Physic... | 9 |
1
The Gaussian Interference Channel in the Presence
of Malicious Jammers
arXiv:1712.04133v1 [cs.IT] 12 Dec 2017
Fatemeh Hosseinigoki1 and Oliver Kosut1
Abstract
This paper considers the two-user Gaussian interference channel in the presence of adversarial
jammers. We first provide a general model including an arbit... | 7 |
February 12, 2014 3:6 WSPC/INSTRUCTION FILE
ws-ijmpc
arXiv:1402.2440v1 [cs.CE] 11 Feb 2014
International Journal of Modern Physics C
c World Scientific Publishing Company
VALIDATION EXPERIMENTS FOR LBM SIMULATIONS OF
ELECTRON BEAM MELTING
REGINA AMMER∗ and ULRICH RÜDE†
Department of Computer Science 10 System Sim... | 5 |
arXiv:1709.06441v1 [math.GR] 19 Sep 2017
EVERY GROUP IS THE OUTER AUTOMORPHISM GROUP
OF AN HNN-EXTENSION OF A FIXED TRIANGLE GROUP
ALAN D. LOGAN
Abstract. Fix an equilateral triangle group Ti = ha, b; ai , bi , (ab)i i with
i ≥ 6 arbitrary. Our main result is: for every presentation P of every
countable group Q there... | 4 |
1
Coordinate-Descent Diffusion Learning by
Networked Agents
arXiv:1607.01838v2 [cs.MA] 11 Oct 2017
Chengcheng Wang, Student Member, IEEE, Yonggang Zhang, Senior Member, IEEE,
Bicheng Ying, Student Member, IEEE, and Ali H. Sayed, Fellow, IEEE
Abstract—This work examines the mean-square error performance of diffusion... | 3 |
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 |
Random Monomial Ideals1
arXiv:1701.07130v2 [math.AC] 5 Jan 2018
Jesús A. De Loera, Sonja Petrović, Lily Silverstein, Despina Stasi, Dane Wilburne
Abstract: Inspired by the study of random graphs and simplicial complexes, and motivated
by the need to understand average behavior of ideals, we propose and study proba... | 0 |
Soft-Deep Boltzmann Machines
arXiv:1505.02462v3 [cs.NE] 21 Jun 2015
Taichi Kiwaki
Graduate School of Engineering
The University of Tokyo
kiwaki@sat.t.u-tokyo.ac.jp
Abstract
We present a layered Boltzmann machine (BM) that can better exploit the advantages of a distributed representation. It is widely believed that d... | 9 |
arXiv:1603.03836v1 [cs.DS] 12 Mar 2016
Near-Isometric Binary Hashing for Large-scale Datasets
Amirali Aghazadeh
Department of Electrical and Computer Engineering, Rice University, Houston, TX, USA
AMIRALI @ RICE . EDU
Andrew Lan
Department of Electrical and Computer Engineering, Rice University, Houston, TX, USA
M... | 8 |
CSA++: Fast Pattern Search for Large Alphabets
Simon Gog1,2 , Alistair Moffat1 , and Matthias Petri1
arXiv:1605.05404v1 [cs.DS] 18 May 2016
1
Dept. Computing and Information Systems, The University of Melbourne, Australia
2 Inst. Theoretical Informatics, Karlsruhe Institute of Technology, Germany
Abstract. Indexed ... | 8 |
The Refinement Calculus of Reactive Systems∗
Viorel Preoteasa
Iulia Dragomir
Stavros Tripakis
arXiv:1710.03979v2 [cs.LO] 8 Feb 2018
February 9, 2018
Abstract
The Refinement Calculus of Reactive Systems (RCRS) is a compositional formal framework for modeling and reasoning about reactive systems. RCRS provides a lan... | 6 |
INITIAL MONOMIAL INVARIANTS OF HOLOMORPHIC MAPS
arXiv:1502.03434v3 [math.CV] 9 Sep 2015
DUSTY GRUNDMEIER AND JIŘÍ LEBL
Abstract. We study a new biholomorphic invariant of holomorphic maps between domains in different dimensions based on generic initial ideals. We start with the standard
generic monomial ideals to f... | 0 |
Quantum Recursion and Second Quantisation
Mingsheng Ying
arXiv:1405.4443v2 [quant-ph] 6 Aug 2014
University of Technology, Sydney, Australia
and
Tsinghua University, China
Mingsheng.Ying@uts.edu.au; yingmsh@tsinghua.edu.cn
Abstract. This paper introduces a new notion of quantum recursion of which
the control flow of... | 6 |
Resumptions, Weak Bisimilarity and Big-Step Semantics for
While with Interactive I/O:
An Exercise in Mixed Induction-Coinduction
Keiko Nakata and Tarmo Uustalu
Institute of Cybernetics at Tallinn University of Technology, Akadeemia tee 21, EE-12618 Tallinn, Estonia
{keiko|tarmo}@cs.ioc.ee
We look at the operational se... | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.