text stringlengths 2.85k 2.55M | label int64 0 10 |
|---|---|
Please cite this article as:
Cuevas, E., Sención-Echauri, F., Zaldivar, D., Pérez-Cisneros, M. Multi-circle detection on images using artificial bee
colony (ABC) optimization, Soft Computing, 16 (2), (2012), pp. 281-296.
Multi-Circle Detection on Images Using Artificial
Bee Colony (ABC) Optimization
Erik Cuevas, Felip... | 9 |
Synthesising Choreographies from Local Session Types
(extended version)
Julien Lange and Emilio Tuosto
arXiv:1204.2566v1 [cs.PL] 11 Apr 2012
Department of Computer Science, University of Leicester, UK
Abstract. Designing and analysing multiparty distributed interactions can be
achieved either by means of a global vi... | 6 |
Graph Based Recommendations: From Data
Representation to Feature Extraction and Application
arXiv:1707.01250v1 [cs.IR] 5 Jul 2017
Amit Tiroshi, Tsvi Kuflik, Shlomo Berkovsky, Mohamed Ali (Dali) Kaafar
Abstract
Modeling users for the purpose of identifying their preferences and then personalizing services on the basi... | 2 |
A non-interleaving process calculus for multi-party
synchronisation
Paweł Sobociński
ECS, University of Southampton
We introduce the wire calculus. Its dynamic features are inspired by Milner’s CCS: a unary prefix operation, binary choice and a standard recursion construct. Instead of an interleaving parallel
composi... | 6 |
An Early Warning System for Bankruptcy Prediction:
lessons from the Venezuelan Bank Crisis
Financial Markets. Investments and Risk Management
Loren Trigo
Professor
Center for Production and Technological Innovation
Instituto de Estudios Superiores de Administración
Calles IESA, San Bernardino, Caracas, Venezuela
58 212... | 5 |
Static Analysis of Lockless Microcontroller C Programs
Eva Beckschulze
Sebastian Biallas
Stefan Kowalewski
Embedded Software Laboratory
RWTH Aachen University, Germany
{lastname}@embedded.rwth-aachen.de
Concurrently accessing shared data without locking is usually a subject to race conditions resulting
in inconsist... | 6 |
From Regexes to Parsing Expression Grammars
Sérgio Medeiros
arXiv:1210.4992v1 [cs.FL] 17 Oct 2012
Department of Computer Science – UFS – Aracaju – Brazil
Fabio Mascarenhas
Department of Computer Science – UFRJ – Rio de Janeiro – Brazil
Roberto Ierusalimschy
Department of Computer Science – PUC-Rio – Rio de Janeiro... | 6 |
KAZHDAN SETS IN GROUPS AND EQUIDISTRIBUTION
PROPERTIES
by
arXiv:1601.04289v4 [math.GR] 3 Jun 2017
Catalin Badea & Sophie Grivaux
Abstract. — Using functional and harmonic analysis methods, we study Kazhdan sets in
topological groups which do not necessarily have Property (T). We provide a new criterion for
a generat... | 4 |
arXiv:1710.05735v1 [math.NA] 12 Oct 2017
Nonnegative Polynomial with no Certificate of
Nonnegativity in the Simplicial Bernstein Basis
Christoffer Sloth
University of Southern Denmark
SDU Robotics
chsl@mmmi.sdu.dk
Abstract
This paper presents a nonnegative polynomial that cannot be represented with nonnegative coeffic... | 3 |
A Rule-Based Computational Model of Cognitive Arithmetic
Ashis Pati, Kantwon Rogers and Hanqing Zhu
arXiv:1705.01208v1 [cs.AI] 3 May 2017
Georgia Institute of Technology
Atlanta, Georgia, United States 30318
{ashis.pati,kantwonrogers,williamzhu}@gatech.edu
Abstract
Cognitive arithmetic studies the mental processes u... | 2 |
HOPF ALGEBRAS FOR MATROIDS OVER HYPERFIELDS
arXiv:1712.08903v1 [math.CO] 24 Dec 2017
CHRISTOPHER EPPOLITO, JAIUNG JUN, AND MATT SZCZESNY
Abstract. Recently, M. Baker and N. Bowler introduced the notion of matroids over hyperfields as a unifying theory of various generalizations of matroids. In this paper we generali... | 0 |
arXiv:1601.01679v2 [math.GR] 14 Jan 2016
MORE ON REGULAR SUBGROUPS OF THE AFFINE GROUP
M.A. PELLEGRINI AND M.C. TAMBURINI BELLANI
Abstract. This paper is a new contribution to the study of regular subgroups
of the affine group AGLn (F), for any field F. In particular we associate to any
partition λ 6= (1n+1 ) of n + 1... | 4 |
Wireless Link Capacity under Shadowing and Fading
arXiv:1706.05269v1 [cs.IT] 16 Jun 2017
Magnús M. Halldórsson
Tigran Tonoyan
ICE-TCS, School of Computer Science
Reykjavik University
mmh@ru.is,ttonoyan@gmail.com
June 19, 2017
Abstract
We consider the following basic link capacity (a.k.a., one-shot scheduling) pr... | 7 |
arXiv:1706.05201v1 [cs.IT] 16 Jun 2017
THE MONTENEGRIN ACADEMY OF SCIENCES AND ARTS
PROCEEDINGS OF THE SECTION OF NATURAL SCIENCES, 22, 2017.
Conditions for Unique Reconstruction of Sparse
Signals Using Compressive Sensing Methods
Ljubiša Stanković, Miloš Daković, Srdjan Stanković, Irena Orović
Abstract
A signal... | 7 |
Adapting Graph Application Performance Via
Alternate Data Structure Representations
Amlan Kusum
Iulian Neamtiu
Rajiv Gupta
University Of California,
Riverside
University Of California,
Riverside
University Of California,
Riverside
arXiv:1412.8120v1 [cs.PL] 28 Dec 2014
akusu001@cs.ucr.edu
neamtiu@cs.ucr.edu
gup... | 6 |
arXiv:1712.07426v1 [math.GR] 20 Dec 2017
Actions of E−dense semigroups and an application to
the discrete log problem
James Renshaw
Mathematical Sciences
University of Southampton
Southampton, SO17 1BJ
England
j.h.renshaw@maths.soton.ac.uk
June 2017
Abstract
We describe the structure of E−dense acts over E−dense semi... | 4 |
Under review as a workshop contribution at ICLR 2015
I MPROVING APPROXIMATE RPCA WITH A K - SPARSITY
PRIOR
arXiv:1412.8291v1 [cs.NE] 29 Dec 2014
Maximilian Karl & Christian Osendorfer
Fakultät für Informatik
Technische Universität München
{karlma,osendorf}@in.tum.de
A BSTRACT
A process centric view of robust PC... | 9 |
arXiv:1312.0325v1 [math.AC] 2 Dec 2013
On the (n, d)th f -Ideals
∗
Jin Guo†, Tongsuo Wu‡
Department of Mathematics, Shanghai Jiaotong University
Abstract. A square-free monomial ideal I is called an f -ideal, if both
δF (I) and δN (I) have the same f -vector, where δF (I) (δN (I), respectively) is the facet (Stanle... | 0 |
arXiv:1401.6579v1 [math.AC] 25 Jan 2014
ISOMORPHISMS BETWEEN JACOBSON GRAPHS
A. AZIMI, A. ERFANIAN AND M. FARROKHI D. G.
Abstract. Let R be a commutative ring with a non-zero identity and JR be
its Jacobson graph. We show that if R and R′ are finite commutative rings,
then JR ∼
= JR′ if and only if |J(R)| = |J(R′ )| a... | 0 |
Towards ECDSA key derivation from deep embeddings for
novel Blockchain applications
Christian S. Perone
arXiv:1711.04069v1 [cs.CV] 11 Nov 2017
christian.perone@gmail.com
http://blog.christianperone.com
Abstract. In this work, we propose a straightforward method to derive Elliptic Curve Digital
Signature Algorithm (E... | 1 |
A novel normalized sign algorithm for system
identification under impulsive noise interference
Lu Lu • Haiquan Zhao • Kan Li • Badong Chen
Abstract. To overcome the performance degradation of adaptive filtering algorithms in the presence of impulsive noise, a novel normalized sign algorithm
(NSA) based on a convex com... | 3 |
arXiv:1708.09262v2 [math.NT] 3 Sep 2017
BOUNDED GENERATION OF SL2 OVER RINGS OF S-INTEGERS WITH
INFINITELY MANY UNITS
ALEKSANDER V. MORGAN, ANDREI S. RAPINCHUK, AND BALASUBRAMANIAN SURY
Abstract. Let O be the ring of S-integers in a number field k. We prove that if the group of units
O× is infinite then every matrix i... | 4 |
arXiv:1512.08555v1 [cs.DS] 28 Dec
1
Maximium Priority Matchings
Jonathan Turner
wucse-2015-06
Abstract
Let G = (V, E) be an undirected graph with n vertices and m edges,
in which each vertex u is assigned an integer priority in [1, n], with 1
being the “highest” priority. Let M be a matching of G. We define
the prior... | 8 |
arXiv:1705.07755v1 [cs.NE] 19 May 2017
Improving classification accuracy of feedforward neural networks for spiking
neuromorphic chips
Antonio Jimeno Yepes, Jianbin Tang, Benjamin Scott Mashford
antonio.jimeno@au1.ibm.com, jbtang@au1.ibm.com, bmashfor@au1.ibm.com
IBM Research Australia, Carlton, 3053, VIC, Australia
... | 9 |
Learning General Latent-Variable Graphical Models with
Predictive Belief Propagation and Hilbert Space Embeddings
arXiv:1712.02046v1 [cs.LG] 6 Dec 2017
Borui Wang
Stanford University
Abstract
In this paper, we propose a new algorithm for
learning general latent-variable probabilistic graphical models using the techn... | 2 |
Repeated Games with Vector Losses: A Set-valued Dynamic
Programming Approach
arXiv:1603.04981v4 [cs.GT] 7 Jan 2018
Vijay Kamble∗
Patrick Loiseau†
Jean Walrand‡
January 9, 2018
Abstract
We consider infinitely repeated games with vector losses discounted over time. We characterize the set of minimal upper bounds on... | 8 |
1
Energy Management for Energy Harvesting
Wireless Sensors with Adaptive Retransmission
Animesh Yadav, Member, IEEE, Mathew Goonewardena, Student Member, IEEE, Wessam
arXiv:1710.09034v1 [cs.IT] 25 Oct 2017
Ajib, Senior Member, IEEE, Octavia A. Dobre, Senior Member, IEEE, and Halima
Elbiaze, Member, IEEE
Abstract
Thi... | 7 |
Fused Trees: Simple BST balancing method by partial & scheduled rebuilds
Tae Woo Kim
Department of Computer Science
Yonsei University, Korea
travis1829@yonsei.ac.kr
Abstract
This paper proposes a simple method to balance a binary search tree, as an attempt to develop the simplest and
most explicit procedure. For a gi... | 8 |
Automated Verification and Synthesis of
Embedded Systems using Machine Learning
Lucas Cordeiro
Department of Computer Science, University of Oxford, UK
E-mail: lucas.cordeiro@cs.ox.ac.uk
arXiv:1702.07847v2 [cs.LO] 28 Feb 2017
ABSTRACT
The dependency on the correct functioning of embedded systems
is rapidly growing, m... | 3 |
Effective algorithms for homogeneous utility functions.
arXiv:1801.00777v1 [cs.DS] 29 Dec 2017
Alexander Shananin
∗
Sergey Tarasov
†
tweets: I am an economist so I can ignore
computational constraints.
I am a computer scientist, so I can ignore
gravity.
Lance Fortnow, a computer scientist
Abstract
Under the assum... | 8 |
arXiv:1704.05134v2 [cs.NE] 19 Apr 2017
Learning Linear Feature Space Transformations
in Symbolic Regression
Jan Žegklitz
Petr Pošı́k
Czech Technical University in Prague
Czech Institute of Informatics, Robotics and Cybernetics
Jugoslávských partyzánů 1580/3
Prague 6, Czech Republic 160 00
zegkljan@fel.cvut.cz
... | 9 |
Tame Decompositions and Collisions
arXiv:1402.5945v1 [math.AC] 24 Feb 2014
Konstantin Ziegler
B-IT, Universität Bonn
D-53113 Bonn, Germany
zieglerk@bit.uni-bonn.de
http://cosec.bit.uni-bonn.de/
April 10, 2018
Abstract
A univariate polynomial f over a field is decomposable if f =
g ◦ h = g(h) for nonlinear polynomials... | 0 |
arXiv:1509.02473v2 [math.ST] 3 May 2017
A new non-parametric detector of univariate outliers for
distributions with unbounded support
Jean-Marc Bardet
and
Solohaja-Faniaha Dimby∗
S.A.M.M., Université de Paris 1 Panthéon-Sorbonne
90, rue de Tolbiac, 75634, Paris, France
Abstract
The purpose of this paper is to const... | 10 |
1
Private Information Retrieval from Transversal
Designs
Julien L AVAUZELLE
Laboratoire LIX, École Polytechnique, Inria & CNRS UMR 7161
Université Paris-Saclay
arXiv:1709.07952v1 [cs.IT] 22 Sep 2017
Abstract
Private information retrieval (PIR) protocols allow a user to retrieve entries of a database without revealin... | 7 |
FROBENIUS AND VALUATION RINGS
arXiv:1507.06009v3 [math.AC] 29 Dec 2016
RANKEYA DATTA AND KAREN E. SMITH
Abstract. The behavior of the Frobenius map is investigated for valuation rings of prime
characteristic. We show that valuation rings are always F-pure. We introduce a generalization of the notion of strong F-regu... | 0 |
arXiv:1802.10178v1 [math.AC] 27 Feb 2018
ON THE CONTAINMENT PROBLEM FOR FAT POINTS
IMAN BAHMANI JAFARLOO
GIUSEPPE ZITO
Abstract. Given an ideal I, the containment problem is concerned about finding
the values m and n such that the m-th symbolic power of I is contained in its n-th
ordinary power. In this paper we con... | 0 |
arXiv:1605.08534v1 [math.ST] 27 May 2016
On the two-filter approximations of marginal smoothing
distributions in general state space models
Thi Ngoc Minh Nguyen∗
Sylvain Le Corff†
Eric Moulines‡
Abstract
A prevalent problem in general state space models is the approximation of the
smoothing distribution of a state ... | 10 |
arXiv:0708.0505v1 [cs.AI] 3 Aug 2007
Alma Mater Studiorum
Università degli Studi di Bologna
DEIS
A preliminary analysis on
metaheuristics methods applied to
the Haplotype Inference Problem
Luca Di Gaspero
Andrea Roli
August 3, 2007
DEIS Technical Report no. DEIS-LIA-006-07
LIA Series no. 84
A preliminary analy... | 5 |
Planar Disjoint-Paths Completionab
arXiv:1511.04952v2 [cs.DS] 17 Nov 2015
Isolde Adlerc
Stavros G. Kolliopoulosd
Dimitrios M. Thilikosef
Abstract
We introduce Planar Disjoint Paths Completion, a completion counterpart of
the Disjoint Paths problem, and study its parameterized complexity. The problem
can be stated ... | 8 |
Forking and JSJ decompositions in the free group II
Chloé Perin
Rizos Sklinos
arXiv:1801.07908v1 [math.GR] 24 Jan 2018
January 25, 2018
Abstract
We give a complete characterization of the forking independence relation over any set
of parameters in the free groups of finite rank, in terms of the JSJ decomposition re... | 4 |
Evolutionary Optimization for Decision Making
under Uncertainty
Ronald Hochreiter
arXiv:1401.4696v1 [cs.NE] 19 Jan 2014
May 2011
Abstract
Optimizing decision problems under uncertainty can be done using a variety of solution methods. Soft computing and heuristic approaches tend to
be powerful for solving such problem... | 9 |
EWENS SAMPLING AND INVARIABLE GENERATION
arXiv:1610.04212v2 [math.PR] 15 Oct 2016
GERANDY BRITO, CHRISTOPHER FOWLER, MATTHEW JUNGE, AND AVI LEVY
Abstract. We study the number of random permutations needed to invariably generate the symmetric group, Sn , when the distribution of cycle counts has the strong
α-logarith... | 4 |
Towards Parallelizable Sampling–based
Nonlinear Model Predictive Control
R.V. Bobiti ∗ M. Lazar ∗
arXiv:1701.02660v2 [cs.SY] 12 Jan 2017
∗
Department of Electrical Engineering, Eindhoven University of Technology,
The Netherlands (e–mails: r.v.bobiti@tue.nl, m.lazar@tue.nl)
Abstract: This paper proposes a new sampli... | 3 |
NONCOMMUTATIVE RESOLUTIONS OF DISCRIMINANTS
RAGNAR-OLAF BUCHWEITZ, ELEONORE FABER, AND COLIN INGALLS
arXiv:1702.00791v1 [math.AG] 2 Feb 2017
A BSTRACT. We give an introduction to the McKay correspondence and its connection to
quotients of Cn by finite reflection groups. This yields a natural construction of noncommut... | 0 |
Implementation of a “language driven” Backpropagation algorithm
I.V. Grossua,*, C.I. Ciuluvica (Neagu)b,*
a
University of Bucharest, Faculty of Physics, Bucharest-Magurele, P.O. Box MG 11, 077125,
Romania
b
University of Bucharest, Faculty of Psychology and Education Sciences, 90 Panduri Street,
District 5 Bucharest, ... | 9 |
1
On the Properties of the Compound Nodal
Admittance Matrix of Polyphase Power Systems
arXiv:1712.08764v1 [cs.SY] 23 Dec 2017
Andreas Martin Kettner, Member, IEEE, and Mario Paolone, Senior Member, IEEE
Abstract—Most techniques for power system analysis model
the grid by exact electrical circuits. For instance, in ... | 3 |
Entropy 2017, , 1-; doi: To be determined
OPEN ACCESS
entropy
ISSN 1099-4300
www.mdpi.com/journal/entropy
Article
Computing Entropies With Nested Sampling
Brendon J. Brewer
arXiv:1707.03543v2 [stat.CO] 16 Aug 2017
Department of Statistics, The University of Auckland, Private Bag 92019, Auckland 1142, New Zealand
A... | 7 |
Promises and Caveats of Uplink
IoT Ultra-Dense Networks
Ming Ding‡ , David López Pérez†
‡
arXiv:1801.06623v1 [cs.NI] 20 Jan 2018
†
Data61, Australia {Ming.Ding@data61.csiro.au}
Nokia Bell Labs, Ireland {david.lopez-perez@nokia.com}
Abstract—In this paper, by means of simulations, we evaluate
the uplink (UL) perfo... | 7 |
1
On the Support Recovery of Jointly Sparse
Gaussian Sources using Sparse Bayesian Learning
Saurabh Khanna, Student Member, IEEE and Chandra R. Murthy, Senior Member, IEEE
arXiv:1703.04930v3 [cs.IT] 26 Oct 2017
Dept. of ECE, Indian Institute of Science, Bangalore, India
{sakhanna, cmurthy}@iisc.ac.in
Abstract—In thi... | 7 |
JOURNAL OF IEEE TRANSACTIONS ON XX, VOL. X, NO. X, XX 2018
1
Dual Asymmetric Deep Hashing Learning
arXiv:1801.08360v1 [cs.CV] 25 Jan 2018
Jinxing Li, Bob Zhang, Member, IEEE, Guangming Lu, David Zhang*, Fellow, IEEE
Abstract—Due to the impressive learning power, deep learning
has achieved a remarkable performance ... | 1 |
Aligned Drawings of Planar Graphs?
Tamara Mchedlidze1 , Marcel Radermacher1 , and Ignaz Rutter2
arXiv:1708.08778v3 [cs.DS] 21 Nov 2017
1
Department of Computer Science, Karlsruhe Institute of Technology, Germany
2
Department of Mathematics and Computer Science, TU Eindhoven, The
Netherlands,
mched@iti.uka.de, raderm... | 8 |
Dominating Sets in Intersection Graphs
of Finite Groups
Selçuk Kayacan∗
arXiv:1602.03537v2 [math.GR] 15 Jul 2017
Department of Mathematics, Istanbul Technical University,
34469 Maslak, Istanbul, Turkey.
e-mail: kayacan.selcuk@gmail.com
Abstract
Let G be a group. The intersection graph Γ(G) of G is an undirected
graph... | 4 |
arXiv:1605.02956v1 [math.CO] 10 May 2016
PROJECTIVE DIMENSION OF (HYPER)GRAPHS AND THE
CASTELNUOVO-MUMFORD REGULARITY OF BIPARTITE GRAPHS
TÜRKER BIYIKOĞLU AND YUSUF CIVAN
Abstract. We prove that proj-dimpHq ď regpLpHqq holds for any (hyper)graph H,
where LpHq denotes the Levi graph (the incidence bipartite graph) of... | 0 |
1
Diffusion leaky LMS algorithm: analysis and implementation
Lu Lu, Haiquan Zhao*
School of Electrical Engineering, Southwest Jiaotong University, Chengdu, China.
https://doi.org/10.1016/j.sigpro.2017.05.015
COMMENT: This paper has been published in Signal Processing
ABSTRACT—The diffusion least-mean square (dLMS) al... | 3 |
Learning Networks from Random Walk-Based Node Similarities
Jeremy G. Hoskins∗
Cameron Musco†
Christopher Musco‡
Charalampos E. Tsourakakis§
arXiv:1801.07386v1 [cs.SI] 23 Jan 2018
January 24, 2018
Abstract
Digital presence in the world of online social media entails significant privacy risks [6, 10,
33, 58, 34]. In... | 8 |
Interactive Timetabling
Tomáš Müller, Roman Barták*
Charles University
Department of Theoretical Computer Science
Malostranské náměstí 2/25, Praha 1, Czech Republic
tomas.muller@st.mff.cuni.cz
bartak@kti.mff.cuni.cz
Abstract. Timetabling is a typical application of constraint programming
whose task is to allocate acti... | 6 |
arXiv:1803.03938v1 [math.AC] 11 Mar 2018
Про моногеннi функцiї, визначенi в рiзних
комутативних алгебрах
Вiталiй С. Шпакiвський
Анотацiя. Встановлено вiдповiднiсть мiж моногенною функцiєю в довiльнiй скiнченновимiрнiй комутативнiй асоцiативнiй алгебрi i скiнченним набором моногенних функцiй в спецiальнiй комутативнiй... | 0 |
Data Rate for Distributed Consensus of Multi-agent
Systems with High Order Oscillator Dynamics
Zhirong Qiu1 , Lihua Xie†,1 , and Yiguang Hong2
arXiv:1609.09206v1 [cs.SY] 29 Sep 2016
Abstract
Distributed consensus with data rate constraint is an important research topic of multi-agent systems. Some results have been
o... | 3 |
Optimal Warping Paths are unique for almost
every Pair of Time Series
arXiv:1705.05681v2 [cs.LG] 2 Mar 2018
Brijnesh J. Jain and David Schultz
Technische Universität Berlin, Germany
e-mail: brijnesh.jain@gmail.com
Update rules for learning in dynamic time warping spaces are based on optimal warping
paths between pa... | 2 |
arXiv:0906.3920v1 [cs.PL] 22 Jun 2009
Reasoning About a Service-oriented Programming Paradigm
Claudio Guidi1
Fabrizio Montesi1
Department of Computer Science, University of Bologna, Italy
italianaSoftware s.r.l., Italy
cguidi@cs.unibo.it
fmontesi@italianasoftware.com
This paper is about a new way for programming... | 6 |
Autonomous Driving in Reality with Reinforcement Learning and Image
Translation
Nayun Xu
Bowen Tan
Bingyu Kong
Shanghai Jiao Tong University
arXiv:1801.05299v1 [cs.CV] 13 Jan 2018
{xunayun, tanbowen, crystal mis}@sjtu.edu.cn
Abstract
Supervised learning is widely used in training autonomous driving vehicle. However... | 1 |
Accepted as a workshop contribution at ICLR 2015
T RAINING DEEP NEURAL NETWORKS
ON NOISY LABELS WITH BOOTSTRAPPING
arXiv:1412.6596v3 [cs.CV] 15 Apr 2015
Scott E. Reed & Honglak Lee
Dept. of Electrical Engineering and Computer Science, University of Michigan
Ann Arbor, MI, USA
{reedscot,honglak}@umich.edu
Dragomir An... | 9 |
arXiv:1604.08267v1 [math.GT] 27 Apr 2016
RANK GRADIENTS OF INFINITE CYCLIC COVERS OF KÄHLER
MANIFOLDS
STEFAN FRIEDL AND STEFANO VIDUSSI
Abstract. Given a Kähler group G and a primitive class φ ∈ H 1 (G; Z), we show
that the rank gradient of (G, φ) is zero if and only if Ker φ ≤ G finitely generated.
Using this appro... | 4 |
SpCoSLAM 2.0: An Improved and Scalable Online Learning of
Spatial Concepts and Language Models with Mapping*
arXiv:1803.03481v1 [cs.RO] 9 Mar 2018
Akira Taniguchi1 , Yoshinobu Hagiwara1 , Tadahiro Taniguchi1 , and Tetsunari Inamura2
Abstract— In this paper, we propose a novel online learning
algorithm, SpCoSLAM 2.0 f... | 2 |
Linear Convergence of a Frank-Wolfe Type Algorithm over
Trace-Norm Balls
arXiv:1708.02105v3 [cs.LG] 9 Nov 2017
Zeyuan Allen-Zhu
Microsoft Research, Redmond
zeyuan@csail.mit.edu
Wei Hu
Princeton University
huwei@cs.princeton.edu
Elad Hazan
Princeton University
ehazan@cs.princeton.edu
Yuanzhi Li
Princeton University
y... | 8 |
Microsimulation of the Port of Dover
Chris Roadknight, Uwe Aickelin and Galina Sherman
Intelligent Modelling & Analysis Research Group (IMA)
School of Computer Science
The University of Nottingham
Jubilee Campus
Wollaton Road
Nottingham NG8 1BB
{cmr,uxa}@cs.nott.ac.uk
G.Sherman@2008.hull.ac.uk
Abstract— Modelling and s... | 5 |
Some Investigations about the Properties of Maximum Likelihood
Estimations Based on Lower Record Values for a Sub-Family of the
Exponential Family
S. D. Gore1, P. Nasiri2, S. Hosseini3, and M. F. Naeini4
Abstract:
Here, in this paper it has been considered a sub family of exponential family. Maximum likelihood
estimat... | 10 |
Using Convolutional Codes for Key Extraction in
SRAM Physical Unclonable Functions
Sven Müelich∗ , Sven Puchinger∗, Martin Bossert∗
arXiv:1704.01306v2 [cs.IT] 10 Jan 2018
∗
Ulm University, Institute of Communications Engineering, 89081 Ulm, Germany
Email: {sven.mueelich, sven.puchinger, martin.bossert}@uni-ulm.de
A... | 7 |
Inverse monoids associated with the complexity class NP
J.C. Birget
arXiv:1703.02519v1 [math.GR] 7 Mar 2017
6 March 2017
Abstract
We study the P versus NP problem through properties of functions and monoids, continuing
the work of [3]. Here we consider inverse monoids whose properties and relationships determine
whe... | 4 |
1
Coordination in Distributed Networks via
Coded Actions with Application to Power
Control
arXiv:1501.03685v4 [cs.IT] 14 Aug 2017
Benjamin Larrousse, Samson Lasaulce, and Matthieu R. Bloch
{larrousse, lasaulce}@lss.supelec.fr, matthieu.bloch@ece.gatech.edu
Abstract
This paper investigates the problem of coordinating... | 7 |
SPRINGER’S WEYL GROUP REPRESENTATION VIA LOCALIZATION
arXiv:1505.06404v3 [math.AG] 12 Feb 2017
JIM CARRELL AND KIUMARS KAVEH
Abstract. Let G denote a reductive algebraic group over C and x a nilpotent element
of its Lie algebra g. The Springer variety Bx is the closed subvariety of the flag variety
B of G parameteri... | 4 |
1
A New Backpressure Algorithm for Joint Rate
Control and Routing with Vanishing Utility
Optimality Gaps and Finite Queue Lengths
Hao Yu and Michael J. Neely
Department of Electrical Engineering
University of Southern California
arXiv:1701.04519v1 [cs.NI] 17 Jan 2017
Abstract
The backpressure algorithm has been wide... | 3 |
High-dimensional Bayesian inference via the Unadjusted
Langevin Algorithm
arXiv:1605.01559v3 [math.ST] 21 Feb 2018
Alain Durmus1 and Éric Moulines2
1
CMLA - École normale supérieure Paris-Saclay, CNRS, Université Paris-Saclay,
94235 Cachan, France.
2
Centre de Mathématiques Appliquées, UMR 7641, Ecole Polytech... | 10 |
1
Privacy-preserving Average Consensus: Privacy
Analysis and Optimal Algorithm Design
arXiv:1609.06368v2 [cs.SY] 9 Feb 2017
Jianping He1,2 , Lin Cai2 , Chengcheng Zhao3 , Peng Cheng3 , and Xinping Guan1
Abstract—Privacy-preserving average consensus aims to guarantee the privacy of initial states and asymptotic cons... | 3 |
Lower Bounds for Symbolic Computation on Graphs:
Strongly Connected Components, Liveness, Safety, and Diameter
Krishnendu Chatterjee1 , Wolfgang Dvořák2 , Monika Henzinger3 , and
Veronika Loitzenbauer3,4
1
IST Austria
TU Wien, Institute of Information Systems, Vienna, Austria
3
University of Vienna, Faculty of Comput... | 8 |
Max-affine estimators for convex stochastic programming
arXiv:1609.06331v1 [math.OC] 18 Sep 2016
Gábor Balázs and Csaba Szepesvári
Department of Computing Science, University of Alberta,
Edmonton, Alberta, T6G 2E8, Canada
András György
Department of Electrical and Electronic Engineering,
Imperial College London,... | 3 |
Cooperative Localization for Mobile Agents
A recursive decentralized algorithm based on
arXiv:1505.05908v3 [cs.RO] 5 Oct 2015
Kalman filter decoupling
Solmaz S. Kia, Stephen Rounds and Sonia Martı́nez
Technological advances in ad-hoc networking and miniaturization of electro-mechanical
systems are making possible t... | 3 |
Object category learning and retrieval with
weak supervision
arXiv:1801.08985v1 [cs.CV] 26 Jan 2018
Steven Hickson, Anelia Angelova, Irfan Essa, Rahul Sukthankar
Google Brain / Google Research
(shickson, anelia, irfanessa, sukthankar)@google.com
Abstract
We consider the problem of retrieving objects from image data ... | 1 |
Distributed Kalman Filter in a Network of Linear Dynamical Systems
Damián Marellia,b , Mohsen Zamanic , Minyue Fuc,a
a Department
arXiv:1711.07625v1 [cs.SY] 21 Nov 2017
of Control Science and Engineering and State Key Laboratory of Industrial Control Technology, Zhejiang University, 388
Yuhangtang Road Hangzhou, Zhe... | 3 |
Coordinated trajectory tracking of multiple vertical take-off
and landing UAVs ⋆
arXiv:1711.03261v1 [cs.SY] 9 Nov 2017
Yao Zou a, Ziyang Meng a,
a
Department of Precision Instrument, Tsinghua University, Beijing 100084, P. R. China.
Abstract
This paper investigates the coordinated trajectory tracking problem of mul... | 3 |
A meshless, integration-free, and boundary-only RBF technique
W. Chen* and M. Tanaka
Department of Mechanical System Engineering, Shinshu University, Wakasato 4-17-1, Nagano City,
Nagano, JAPAN (Present email:* mawchen@cityu.edu.hk )
Abstract
Based on the radial basis function (RBF), non-singular general solution and... | 5 |
arXiv:1710.11471v2 [cs.PF] 21 Nov 2017
Distributed Server Allocation for Content Delivery
Networks
Sarath Pattathil, Vivek S. Borkar and Gaurav S. Kasbekar
∗
Abstract
We propose a dynamic formulation of file-sharing networks in terms
of an average cost Markov decision process with constraints. By analyzing a Whittle... | 3 |
Interactive Robot Transition Repair With SMT
Jarrett Holtz, Arjun Guha, Joydeep Biswas
arXiv:1802.01706v1 [cs.RO] 5 Feb 2018
University of Massachusetts Amherst
Abstract
Complex robot behaviors are often structured as
state machines, where states encapsulate actions
and a transition function switches between states.... | 6 |
arXiv:1504.03021v1 [physics.comp-ph] 12 Apr 2015
Elastic properties of the degenerate f.c.c.
crystal of polydisperse soft dimers at zero
temperature
J. W. Narojczyk 1 and K. W. Wojciechowski 2
Institute of Molecular Physics, Polish Academy of Science, Smoluchowskiego 17,
PL-60-179 Poznań, Poland
Abstract
Elastic pro... | 5 |
1
Variation Evolving for Optimal Control
Computation, A Compact Way
Sheng ZHANG and Kai-Feng HE
(2017.08)
Abstract: A compact version of the Variation Evolving Method (VEM) is developed for the optimal control computation. It follows the
idea that originates from the continuous-time dynamics stability theory in the co... | 3 |
arXiv:1611.02466v1 [math.AC] 8 Nov 2016
Serre Dimension of Monoid Algebras
Manoj K. Keshari and Husney Parvez Sarwar
Department of Mathematics, IIT Bombay, Powai, Mumbai - 400076, India;
keshari@math.iitb.ac.in; mathparvez@gmail.com
Abstract
Let R be a commutative Noetherian ring of dimension d, M a commutative cancel... | 0 |
Paradigm and Paradox in Topology Control of Power Grids
Shuai Wang & John Baillieul
arXiv:1803.05852v2 [cs.SY] 16 Mar 2018
Abstract
Corrective Transmission Switching can be used by the grid operator to relieve line overloading and voltage violations,
improve system reliability, and reduce system losses. Power grid op... | 3 |
Understanding Negations in Information Processing:
Learning from Replicating Human Behavior
Nicolas Pröllochsa,∗, Stefan Feuerriegela , Dirk Neumanna
arXiv:1704.05356v1 [cs.AI] 18 Apr 2017
a
Chair for Information Systems Research, University of Freiburg, Platz der Alten Synagoge,
79098 Freiburg, Germany
Abstract
I... | 2 |
1
Deterministic Annealing Optimization for
Witsenhausen’s and Related Decentralized
Stochastic Control Problems
arXiv:1607.02893v1 [cs.SY] 11 Jul 2016
Mustafa Said Mehmetoglu, Student Member, IEEE, Emrah Akyol, Member, IEEE,
and Kenneth Rose, Fellow, IEEE
Abstract—This note studies the global optimization of contro... | 3 |
Sensing-Constrained LQG Control
arXiv:1709.08826v1 [math.OC] 26 Sep 2017
Vasileios Tzoumas,1,2 Luca Carlone,2 George J. Pappas,1 Ali Jadbabaie2
Abstract—Linear-Quadratic-Gaussian (LQG) control is concerned with the design of an optimal controller and estimator
for linear Gaussian systems with imperfect state informa... | 3 |
ADEQUATE SUBGROUPS AND INDECOMPOSABLE MODULES
arXiv:1405.0043v3 [math.RT] 6 Mar 2017
ROBERT GURALNICK, FLORIAN HERZIG, AND PHAM HUU TIEP
Abstract. The notion of adequate subgroups was introduced by Jack Thorne [59]. It
is a weakening of the notion of big subgroups used by Wiles and Taylor in proving automorphy liftin... | 4 |
1
Hydra: an Ensemble of Convolutional Neural
Networks for Geospatial Land Classification
arXiv:1802.03518v1 [cs.CV] 10 Feb 2018
Rodrigo Minetto, Maurı́cio Pamplona Segundo, Sudeep Sarkar
Abstract—We describe in this paper Hydra, an ensemble of convolutional neural networks (CNN) for geospatial land classification.
T... | 1 |
arXiv:1405.2322v2 [math.ST] 4 Oct 2016
Parameter estimation of a two-colored urn model
class
Line Le Goff
Philippe Soulier
January 29, 2018
Abstract
Though widely used in applications, reinforced random walk on graphs
have never been the subject of a valid statistical inference. We develop in
this paper a statistica... | 10 |
Sound and Automated Synthesis of Digital Stabilizing
Controllers for Continuous Plants
∗
Alessandro Abate1 , Iury Bessa2 , Dario Cattaruzza1 , Lucas Cordeiro1,2 ,
Cristina David1 , Pascal Kesseli1 and Daniel Kroening1
arXiv:1610.04761v3 [cs.SY] 16 Feb 2017
1
University of Oxford, Oxford, United Kingdom
ABSTRACT
Mo... | 3 |
On Generalization and Regularization
in Deep Learning
An Introduction for Data Scientists
arXiv:1704.01312v2 [stat.ML] 6 Apr 2017
Pirmin Lemberger
pirmin.lemberger@weave.eu
Weave Business Technology
37 rue du Rocher, 75008 Paris
weave.eu
April 10, 2017
Abstract
Why do large neural network generalize so well on compl... | 10 |
Scheduling Wireless Ad Hoc Networks in
Polynomial Time Using Claw-free Conflict
Graphs
arXiv:1711.01620v1 [cs.IT] 5 Nov 2017
Alper Köse∗† , Muriel Médard∗
∗ Research Laboratory of Electronics, Massachusetts Institute of Technology,
77 Massachusetts Avenue, Cambridge, MA 02139, USA
† Department of Electrical Engineer... | 7 |
Predicting Signed Edges with O(n1+o(1) log n) Queries
Michael Mitzenmacher∗
Charalampos E. Tsourakakis†
arXiv:1609.00750v2 [cs.DS] 4 Oct 2016
Abstract
Social networks and interactions in social media involve both positive and negative relationships. Signed graphs capture both types of relationships: positive edges c... | 8 |
Under review as a conference paper at ICLR 2018
E VIDENCE AGGREGATION FOR A NSWER R E -R ANKING
IN O PEN -D OMAIN Q UESTION A NSWERING
arXiv:1711.05116v1 [cs.CL] 14 Nov 2017
Shuohang Wang1 , Mo Yu2 , Jing Jiang1 ,Wei Zhang2 , Xiaoxiao Guo2 , Shiyu Chang2 , Zhiguo Wang2
Tim Klinger2 , Gerald Tesauro2 and Murray Campb... | 2 |
Unconstrained Scene Text and Video Text
Recognition for Arabic Script
Mohit Jain, Minesh Mathew and C. V. Jawahar
arXiv:1711.02396v1 [cs.CV] 7 Nov 2017
Center for Visual Information Technology, IIIT Hyderabad, India.
mohit.jain@research.iiit.ac.in, minesh.mathew@research.iiit.ac.in, jawahar@iiit.ac.in
Abstract—Build... | 1 |
arXiv:1801.06634v1 [math.ST] 20 Jan 2018
Joint CLT for eigenvalue statistics from
several dependent large dimensional sample
covariance matrices with application
Weiming Li1,* Zeng Li2,** and Jianfeng Yao3,†
1
School of Statistics and
Management
Shanghai University of Finance
and Economics
e-mail:
*
li.weiming@shuf... | 10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.