total 3263took 0.12s

Multi-Stage Fault Warning for Large Electric Grids Using Anomaly Detection and Machine LearningMar 15 2019In the monitoring of a complex electric grid, it is of paramount importance to provide operators with early warnings of anomalies detected on the network, along with a precise classification and diagnosis of the specific fault type. In this paper, we ... More

A polynomial version of Cereceda's conjectureMar 13 2019Let $k$ and $d$ be such that $k \ge d+2$. Consider two $k$-colourings of a $d$-degenerate graph $G$. Can we transform one into the other by recolouring one vertex at each step while maintaining a proper coloring at any step? Cereceda et al. answered that ... More

Financial Applications of Gaussian Processes and Bayesian OptimizationMar 12 2019In the last five years, the financial industry has been impacted by the emergence of digitalization and machine learning. In this article, we explore two methods that have undergone rapid development in recent years: Gaussian processes and Bayesian optimization. ... More

Shapley regressions: A framework for statistical inference on machine learning modelsMar 11 2019Machine learning models often excel in the accuracy of their predictions but are opaque due to their non-linear and non-parametric structure. This makes statistical inference challenging and disqualifies them from many applications where model interpretability ... More

Sparse Grouped Gaussian Processes for Solar Power ForecastingMar 10 2019We consider multi-task regression models where observations are assumed to be a linear combination of several latent node and weight functions, all drawn from Gaussian process priors that allow nonzero covariance between grouped latent functions. Motivated ... More

Only Connect, SecurelyMar 07 2019The lattice model proposed by Denning in her seminal work provided secure information flow analyses with an intuitive and uniform mathematical foundation. Different organisations, however, may employ quite different security lattices. In this paper, we ... More

Socially-Aware Congestion Control in Ad-Hoc Networks: Current Status and The Way ForwardMar 03 2019Ad-hoc social networks (ASNETs) represent a special type of traditional ad-hoc network in which a user's social properties (such as the social connections and communications metadata as well as application data) are leveraged for offering enhanced services ... More

Fair Dimensionality Reduction and Iterative Rounding for SDPsFeb 28 2019We model "fair" dimensionality reduction as an optimization problem. A central example is the fair PCA problem: the input data is divided into $k$ groups, and the goal is to find a single $d$-dimensional representation for all groups for which the maximum ... More

SAFE ML: Surrogate Assisted Feature Extraction for Model LearningFeb 28 2019Complex black-box predictive models may have high accuracy, but opacity causes problems like lack of trust, lack of stability, sensitivity to concept drift. On the other hand, interpretable models require more work related to feature engineering, which ... More

Linear Time Visualization and Search in Big Data using Pixellated Factor Space MappingFeb 27 2019It is demonstrated how linear computational time and storage efficient approaches can be adopted when analyzing very large data sets. More importantly, interpretation is aided and furthermore, basic processing is easily supported. Such basic processing ... More

Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexityFeb 27 2019An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that this algorithm needs at most $O(|\log(\epsilon)|\,\epsilon^{-2})$ evaluations ... More

Parallel Rendering and Large Data VisualizationFeb 23 2019We are living in the big data age: An ever increasing amount of data is being produced through data acquisition and computer simulations. While large scale analysis and simulations have received significant attention for cloud and high-performance computing, ... More

From SA-CCR to RSA-CCR: making SA-CCR self-consistent and appropriately risk-sensitive by cashflow decomposition in a 3-Factor Gaussian Market ModelFeb 22 2019SA-CCR has major issues including: lack of self-consistency for linear trades; lack of appropriate risk sensitivity (zero positions can have material add-ons; moneyness is ignored); dependence on economically-equivalent confirmations. We show that SA-CCR ... More

Robust Asset Allocation for Robo-AdvisorsFeb 20 2019In the last few years, the financial advisory industry has been impacted by the emergence of digitalization and robo-advisors. This phenomenon affects major financial services, including wealth management, employee savings plans, asset managers, etc. ... More

Competitive Concurrent Distributed SchedulingFeb 20 2019We introduce a new scheduling problem in distributed computing that we call the DSMS problem. We are given a set of $k \geq 1$ mobile identical servers that are initially hosted by some processors of the given network. Further, we are given a set of requests ... More

Robot Co-design: Beyond the Monotone CaseFeb 15 2019Recent advances in 3D printing and manufacturing of miniaturized robotic hardware and computing are paving the way to build inexpensive and disposable robots. This will have a large impact on several applications including scientific discovery (e.g., ... More

Constrained Risk Budgeting Portfolios: Theory, Algorithms, Applications & PuzzlesFeb 15 2019This article develops the theory of risk budgeting portfolios, when we would like to impose weight constraints. It appears that the mathematical problem is more complex than the traditional risk budgeting problem. The formulation of the optimization program ... More

On the Convergence of Network SystemsFeb 11 2019The apparent disconnection between the microscopic and the macroscopic is a major issue in the understanding of complex systems. To this extend, we study the convergence of repeatedly applying local rules on a network, and touch on the expressive power ... More

On the number of pancake stacks requiring 4 flips to be sortedFeb 11 2019Feb 26 2019Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted. A similar characterization of the 8-cycles in the burnt pancake graph, ... More

On the number of pancake stacks requiring 4 flips to be sortedFeb 11 2019Using an existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted. A similar characterization of the 8-cycles in the burnt pancake ... More

All those EPPA classes (Strengthenings of the Herwig-Lascar theorem)Feb 11 2019In this paper we prove a general theorem showing the extension property for partial automorphisms (EPPA, also called the Hrushovski property) for classes of structures containing relations and unary functions, optionally equipped with a permutation group ... More

On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag MatchingFeb 10 2019Exact pattern matching in labeled graphs is the problem of searching paths of a graph $G=(V,E)$ that spell the same string as the given pattern $P[1..m]$. This basic problem can be found at the heart of more complex operations on variation graphs in computational ... More

Bernstein Concentration Inequalities for Tensors via Einstein ProductsFeb 08 2019A generalization of the Bernstein matrix concentration inequality to random tensors of general order is proposed. This generalization is based on the use of Einstein products between tensors, from which a strong link can be established between matrices ... More

Constructive Non-Linear Polynomial Cryptanalysis of a Historical Block CipherFeb 07 2019One of the major open problems in symmetric cryptanalysis is to discover new specif i c types of invariant properties which can hold for a larger number of rounds of a block cipher. We have Generalised Linear Cryptanalysis (GLC) and Partitioning Cryptanalysis ... More

Cramér Type Moderate Deviations for Random FieldsFeb 07 2019We study the Cram\'er type moderate deviation for partial sums of random fields by applying the conjugate method. The results are applicable to the partial sums of linear random fields with short or long memory and to nonparametric regression with random ... More

Distributed Ledger Privacy: Ring Signatures, Möbius and CryptoNoteFeb 07 2019Distributed ledger and blockchain systems are expected to make financial systems easier to audit, reduce counter-party risk and transfer assets seamlessly. The key concept is a token controlled by a cryptographic private key for spending, and represented ... More

Stability of the optimal values under small perturbations of the constraint setFeb 06 2019This paper presents a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if we slightly change the constraint set over which the optimal (extreme) values ... More

Minor-Obstructions for Apex Sub-unicyclic GraphsFeb 06 2019A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$-apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We identify 29 graphs that are the minor-obstructions of the class of $1$-apex ... More

(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value ProbingFeb 04 2019Feb 06 2019Consider a kidney-exchange application where we want to find a max-matching in a random graph. To find whether an edge $e$ exists, we need to perform an expensive test, in which case the edge $e$ appears independently with a \emph{known} probability $p_e$. ... More

Stabilization Time in Weighted Minority ProcessesFeb 04 2019A minority process in a weighted graph is a dynamically changing coloring. Each node repeatedly changes its color in order to minimize the sum of weighted conflicts with its neighbors. We study the number of steps until such a process stabilizes. Our ... More

Decentralized Stochastic Optimization and Gossip Algorithms with Compressed CommunicationFeb 01 2019We consider decentralized stochastic optimization with the objective function (e.g. data samples for machine learning task) being distributed over $n$ machines that can only communicate to their neighbors on a fixed communication graph. To reduce the ... More

Local minimax rates for closeness testing of discrete distributionsFeb 01 2019We consider the closeness testing (or two-sample testing) problem in the Poisson vector model - which is known to be asymptotically equivalent to the model of multinomial distributions. The goal is to distinguish whether two data samples are drawn from ... More

Quantum model for price forecasting in financial marketsJan 30 2019The present paper describes a practical example in which the probability distribution of the prices of a stock market blue chip is calculated as the wave function of a quantum particle confined in a potential well. This model may naturally explain the ... More

Simulating the DNA String Graph in Succinct SpaceJan 29 2019Converting a set of sequencing reads into a lossless compact data structure that encodes all the relevant biological information is a major challenge. The classical approaches are to build the string graph or the de Bruijn graph. Each has advantages over ... More

Unique perfect matchings, edge-colored graphs and proof nets for linear logic with MixJan 29 2019This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect matching. ... More

Neural eliminators and classifiersJan 28 2019Classification may not be reliable for several reasons: noise in the data, insufficient input information, overlapping distributions and sharp definition of classes. Faced with several possibilities neural network may in such cases still be useful if ... More

The CM Algorithm for the Maximum Mutual Information Classifications of Unseen InstancesJan 28 2019The Maximum Mutual Information (MMI) criterion is different from the Least Error Rate (LER) criterion. It can reduce failing to report small probability events. This paper introduces the Channels Matching (CM) algorithm for the MMI classifications of ... More

Plantinga-Vegter algorithm takes average polynomial timeJan 26 2019We exhibit a condition-based analysis of the adaptive subdivision algorithm due to Plantinga and Vegter. The first complexity analysis of the PV Algorithm is due to Burr, Gao and Tsigaridas who proved a $O\big(2^{\tau d^{4}\log d}\big)$ worst-case cost ... More

Embedding quadratization gadgets on Chimera and Pegasus graphsJan 23 2019We group all known quadratizations of cubic and quartic terms in binary optimization problems into six and seven unique graphs respectively. We then perform a minor embedding of these graphs onto the well-known Chimera graph, and the brand new Pegasus ... More

Pegasus: The second connectivity graph for large-scale quantum annealing hardwareJan 22 2019Pegasus is a graph which offers substantially increased connectivity between the qubits of quantum annealing hardware compared to the graph Chimera. It is the first fundamental change in the connectivity graph of quantum annealers built by D-Wave since ... More

Solve For Shortest Paths Problem Within Logarithm RuntimeJan 22 2019The Shortest Paths Problem (SPP) is no longer unresolved. Just for a large scalar of instance on this problem, even we cannot know if an algorithm achieves the computing. Those cutting-edge methods are still in the low performance. If we go to a strategy ... More

For which graphs the sages can guess correctly the color of at least one hatJan 22 2019Several sages wearing colored hats occupy the vertices of a graph. Each sage tries to guess the color of his own hat merely on the basis of observing the hats of his neighbours without exchanging any information. Each hat can have one of three colors. ... More

Constrained path-finding and structure from acyclicityJan 21 2019This note presents several results in graph theory inspired by the author's work in the proof theory of linear logic; these results are purely combinatorial and do not involve logic. We show that trails avoiding forbidden transitions and rainbow paths ... More

Extremality and Sharp Bounds for the $k$-edge-connectivity of GraphsJan 18 2019Boesch and Chen (SIAM J. Appl. Math., 1978) introduced the cut-version of the generalized edge-connectivity, named $k$-edge-connectivity. For any integer $k$ with $2\leq k\leq n$, the {\em $k$-edge-connectivity} of a graph $G$, denoted by $\lambda_k(G)$, ... More

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded DegreeJan 16 2019Feb 08 2019Exact pattern matching in labeled graphs is the problem of searching paths of a graph $G=(V,E)$ that spell the same string as the pattern $P[1..m]$. This basic problem can be found at the heart of more complex operations on variation graphs in computational ... More

Extending partial isometries of antipodal graphsJan 14 2019We prove EPPA (extension property for partial automorphisms) for all antipodal classes from Cherlin's list of metrically homogeneous graphs, thereby answering a question of Aranda et al. This paper should be seen as the first application of a new general ... More

Quadratization in discrete optimization and quantum mechanicsJan 14 2019A book about turning high-degree optimization problems into quadratic optimization problems that maintain the same global minimum (ground state). This book explores quadratizations for pseudo-Boolean optimization, perturbative gadgets used in QMA completeness ... More

ChronoMID - Cross-Modal Neural Networks for 3-D Temporal Medical Imaging DataJan 12 2019ChronoMID builds on the success of cross-modal convolutional neural networks (X-CNNs), making the novel application of the technique to medical imaging data. Specifically, this paper presents and compares alternative approaches - timestamps and difference ... More

On Huang and Wong's Algorithm for Generalized Binary Split TreesJan 12 2019Huang and Wong [5] proposed a polynomial-time dynamic-programming algorithm for computing optimal generalized binary split trees. We show that their algorithm is incorrect. Thus, it remains open whether such trees can be computed in polynomial time. Spuler ... More

Depth First Search in the Semi-streaming ModelJan 11 2019Depth first search (DFS) tree is a fundamental data structure for solving various graph problems. The classical DFS algorithm requires $O(m+n)$ time for a graph having $n$ vertices and $m$ edges. In the streaming model, an algorithm is allowed several ... More

Baker game and polynomial-time approximation schemesJan 07 2019Baker devised a technique to obtain approximation schemes for many optimization problems restricted to planar graphs; her technique was later extended to more general graph classes. In particular, using the Baker's technique and the minor structure theorem, ... More

EPPA for two-graphs and antipodal metric spacesDec 28 2018We prove that the class of two-graphs has the extension property for partial automorphisms (EPPA, or Hrushovski property), thereby answering a question of Macpherson. In other words, we show that the class of graphs has the extension property for switching ... More

Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious AttacksDec 28 2018In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers $w$ as reducible permutation flow-graphs $F[\pi^*]$ through the use of self-inverting permutations $\pi^*$. Following ... More

Using First Hitting Times to Find Sets that Maximize the Convergence Rate to ConsensusDec 20 2018In a model of communication in a social network described by a simple consensus model, we pose the problem of finding a subset of nodes with given cardinality and fixed consensus values that enable the fastest convergence rate to equilibrium of the values ... More

Relevant Attributes in Formal ContextsDec 20 2018Computing conceptual structures, like formal concept lattices, is in the age of massive data sets a challenging task. There are various approaches to deal with this, e.g., random sampling, parallelization, or attribute extraction. A so far not investigated ... More

Closed-form expansions for option prices with respect to the mixing solutionDec 19 2018Feb 14 2019We consider closed-form expansions for European put option prices within several stochastic volatility frameworks with time-dependent parameters. Our methodology involves writing the put option price as an expectation of a Black-Scholes formula and performing ... More

Closed-form expansions for option prices with respect to the mixing solutionDec 19 2018We consider closed-form expansions for European put option prices within several stochastic volatility frameworks with time-dependent parameters. Our methodology involves writing the put option price as an expectation of a Black-Scholes formula and performing ... More

Semi-Riemannian Manifold OptimizationDec 18 2018We introduce in this paper a manifold optimization framework that utilizes semi-Riemannian structures on the underlying smooth manifolds. Unlike in Riemannian geometry, where each tangent space is equipped with a positive definite inner product, a semi-Riemannian ... More

1-subdivisions, fractional chromatic number and Hall ratioDec 18 2018The Hall ratio of a graph G is the maximum of |V(H)|/alpha(H) over all subgraphs H of G. Clearly, the Hall ratio of a graph is a lower bound for the fractional chromatic number. It has been asked whether conversely, the fractional chromatic number is ... More

3-Manifold triangulations with small treewidthDec 13 2018Motivated by fixed-parameter tractable (FPT) problems in computational topology, we consider the treewidth of a compact, connected 3-manifold $M$ defined by \[ \operatorname{tw}(M) = \min\{\operatorname{tw}(\Gamma(\mathcal{T})):\mathcal{T}~\text{is a ... More

Shortest Reconfiguration of MatchingsDec 13 2018Imagine that unlabelled tokens are placed on the edges of a graph, such that no two tokens are placed on incident edges. A token can jump to another edge if the edges having tokens remain independent. We study the problem of determining the distance between ... More

On balanced clustering with tree-like structures over clustersDec 09 2018The article addresses balanced clustering problems with an additional requirement as a tree-like structure over the obtained balanced clusters. This kind of clustering problems can be useful in some applications (e.g., network design, management and routing). ... More

A note on solving nonlinear optimization problems in variable precisionDec 09 2018Dec 11 2018This short note considers an efficient variant of the trust-region algorithm with dynamic accuracy proposed Carter (1993) and Conn, Gould and Toint (2000) as a tool for very high-performance computing, an area where it is critical to allow multi-precision ... More

Counting independent sets in graphs with bounded bipartite pathwidthDec 07 2018Mar 03 2019We show that a simple Markov chain, the Glauber dynamics, can efficiently sample independent sets almost uniformly at random in polynomial time for graphs in a certain class. The class is determined by boundedness of a new graph parameter called bipartite ... More

Counting independent sets in graphs with bounded bipartite pathwidthDec 07 2018We show that a simple Markov chain, the Glauber dynamics, can efficiently sample independent sets almost uniformly at random in polynomial time for graphs in a certain class. The class is determined by boundedness of a new graph parameter called bipartite ... More

Euler Transformation of Polyhedral ComplexesDec 06 2018We propose an Euler transformation that transforms a given $d$-dimensional cell complex $K$ for $d=2,3$ into a new $d$-complex $\hat{K}$ in which every vertex is part of a uniform even number of edges. Hence every vertex in the graph $\hat{G}$ that is ... More

A Nonstationary Designer Space-Time KernelDec 01 2018In spatial statistics, kriging models are often designed using a stationary covariance structure; this translation-invariance produces models which have numerous favorable properties. This assumption can be limiting, though, in circumstances where the ... More

Origin of Biomolecular NetworksNov 30 2018Biomolecular networks have already found great utility in characterizing complex biological systems arising from pair-wise interactions amongst biomolecules. Here, we review how graph theoretical approaches can be applied not only for a better understanding ... More

Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor SystemsNov 28 2018We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume and the required number of processors. We propose new constant factor approximation ... More

Attendance Maximization for Successful Social Event PlanningNov 28 2018Social event planning has received a great deal of attention in recent years where various entities, such as event planners and marketing companies, organizations, venues, or users in Event-based Social Networks, organize numerous social events (e.g., ... More

What is known about Vertex Cover Kernelization?Nov 23 2018Feb 14 2019We are pleased to dedicate this survey on kernelization of the Vertex Cover problem, to Professor Juraj Hromkovi\v{c} on the occasion of his 60th birthday. The Vertex Cover problem is often referred to as the Drosophila of parameterized complexity. It ... More

Scalable Label Propagation Algorithms for Heterogeneous NetworksNov 22 2018Heterogeneous networks are large graphs consisting of different types of nodes and edges. They are an important category of complex networks, but the process of knowledge extraction and relations discovery from these networks are so complicated and time-consuming. ... More

The value of forecasts: Quantifying the economic gains of accurate quarter-hourly electricity price forecastsNov 21 2018We propose a multivariate elastic net regression forecast model for German quarter-hourly electricity spot markets. While the literature is diverse on day-ahead prediction approaches, both the intraday continuous and intraday call-auction prices have ... More

Approximation Algorithm for the Partial Set Multi-Cover ProblemNov 20 2018Partial set cover problem and set multi-cover problem are two generalizations of set cover problem. In this paper, we consider the partial set multi-cover problem which is a combination of them: given an element set $E$, a collection of sets $\mathcal ... More

The Preemptive Resource Allocation ProblemNov 18 2018We revisit a classical scheduling model to incorporate modern trends in data center networks and cloud services. Addressing some key challenges in the allocation of shared resources to user requests (jobs) in such settings, we consider the following variants ... More

The problematic nature of potentially polynomial-time algorithms solving the subset-sum problemNov 18 2018The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification which we introduce ... More

Minor-Obstructions for Apex-PseudoforestsNov 16 2018Jan 24 2019A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one of its vertices. We identify 33 graphs that form the minor-obstruction set ... More

Homogeneity-Based Transmissive Process to Model True and False News in Social NetworksNov 16 2018An overwhelming number of true and false news stories are posted and shared in social networks, and users diffuse the stories based on multiple factors. Diffusion of news stories from one user to another depends not only on the stories' content and the ... More

A Note On Universal Point Sets for Planar GraphsNov 15 2018We investigate which planar point sets allow simultaneous straight-line embeddings of all planar graphs on a fixed number of vertices. We first show that $(1.293-o(1))n$ points are required to find a straight-line drawing of each $n$-vertex planar graph ... More

On an Annihilation Number ConjectureNov 12 2018Mar 13 2019Let $\alpha(G)$ denote the cardinality of a maximum independent set, while $\mu(G)$ be the size of a maximum matching in the graph $G=\left(V,E\right) $. If $\alpha(G)+\mu(G)=\left\vert V\right\vert $, then $G$ is a K\"onig-Egerv\'ary graph. If $d_{1}\leq ... More

On an Annihilation Number ConjectureNov 12 2018Jan 31 2019Let $\alpha(G)$ denote the cardinality of a maximum independent set, while $\mu(G)$ be the size of a maximum matching in the graph $G=\left(V,E\right) $. If $\alpha(G)+\mu(G)=\left\vert V\right\vert $, then $G$ is a K\"onig-Egerv\'ary graph. If $d_{1}\leq ... More

Time-interval balancing in multi-processor scheduling of composite modular jobs (preliminary description)Nov 11 2018The article describes a special time-interval balancing in multi-processor scheduling of composite modular jobs. This scheduling problem is close to just-in-time planning approach. First, brief literature surveys are presented on just-in-time scheduling ... More

Recognizing generating subgraphs revisitedNov 11 2018A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. For every graph ... More

Generating subgraphs in chordal graphsNov 11 2018A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. For every graph ... More

A Complexity Dichotomy for Critical Values of the b-Chromatic Number of GraphsNov 09 2018Feb 11 2019A $b$-coloring of a graph $G$ is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph $G$ has a $b$-coloring with $k$ ... More

Deterministic and stochastic inexact regularization algorithms for nonconvex optimization with optimal complexityNov 09 2018Nov 12 2018A regularization algorithm using inexact function values and inexact derivatives is proposed and its evaluation complexity analyzed. This algorithm is applicable to unconstrained problems and to problems with inexpensive constraints (that is constraints ... More

Scalable Robust Kidney ExchangeNov 08 2018In barter exchanges, participants directly trade their endowed goods in a constrained economic setting without money. Transactions in barter exchanges are often facilitated via a central clearinghouse that must match participants even in the face of uncertainty---over ... More

Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear TimeNov 08 2018In the {\em distributed all-pairs shortest paths} problem (APSP), every node in the weighted undirected distributed network (the CONGEST model) needs to know the distance from every other node using least number of communication rounds (typically called ... More

TzK Flow - Conditional Generative ModelNov 05 2018Nov 30 2018We introduce TzK (pronounced "task"), a conditional probability flow-based model that exploits attributes (e.g., style, class membership, or other side information) in order to learn tight conditional prior around manifolds of the target observations. ... More

TzK Flow - Conditional Generative ModelNov 05 2018Feb 19 2019We introduce TzK (pronounced "task"), a conditional probability flow-based model that exploits attributes (e.g., style, class membership, or other side information) in order to learn tight conditional prior around manifolds of the target observations. ... More

Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraintsNov 03 2018We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i.e.\ problems where the cost of evaluating/enforcing of the (possibly nonconvex or even disconnected) constraints, if any, ... More

Improved approximation algorithms for path vertex covers in regular graphsNov 03 2018Given a simple graph $G = (V, E)$ and a constant integer $k \ge 2$, the $k$-path vertex cover problem ({\sc P$k$VC}) asks for a minimum subset $F \subseteq V$ of vertices such that the induced subgraph $G[V - F]$ does not contain any path of order $k$. ... More

Boosted Sparse and Low-Rank Tensor RegressionNov 03 2018We propose a sparse and low-rank tensor regression model to relate a univariate outcome to a feature tensor, in which each unit-rank tensor from the CP decomposition of the coefficient tensor is assumed to be sparse. This structure is both parsimonious ... More

CMI: An Online Multi-objective Genetic Autoscaler for Scientific and Engineering Workflows in Cloud Infrastructures with Unreliable Virtual MachinesNov 02 2018Cloud Computing is becoming the leading paradigm for executing scientific and engineering workflows. The large-scale nature of the experiments they model and their variable workloads make clouds the ideal execution environment due to prompt and elastic ... More

Ground staff shift planning under delay uncertainty at Air FranceNov 01 2018Ground staff agents of airlines operate many jobs at airports such as passengers check-in, planes cleaning, etc. Shift planning aims at building the sequences of jobs operated by ground staff agents, and have been widely studied given its impact on operating ... More

Exploring Parallel-in-Time Approaches for Eddy Current ProblemsOct 31 2018We consider the usage of parallel-in-time algorithms of the Parareal and multigrid-reduction-in-time (MGRIT) methodologies for the parallel-in-time solution of the eddy current problem. Via application of these methods to a two-dimensional model problem ... More

Minimum Reload Cost Graph FactorsOct 27 2018Feb 06 2019The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined by the colors of the two edges. This concept has various applications in transportation networks, ... More

Modeling Perceptual Aliasing in SLAM via Discrete-Continuous Graphical ModelsOct 27 2018Jan 24 2019Perceptual aliasing is one of the main causes of failure for Simultaneous Localization and Mapping (SLAM) systems operating in the wild. Perceptual aliasing is the phenomenon where different places generate a similar visual (or, in general, perceptual) ... More

Informative Features for Model ComparisonOct 27 2018Given two candidate models, and a set of target observations, we address the problem of measuring the relative goodness of fit of the two models. We propose two new statistical tests which are nonparametric, computationally efficient (runtime complexity ... More

A fast algorithm for computing distance correlationOct 26 2018Nov 15 2018Classical dependence measures such as Pearson correlation, Spearman's $\rho$, and Kendall's $\tau$ can detect only monotonic or linear dependence. To overcome these limitations, Szekely et al.(2007) proposed distance covariance as a weighted $L_2$ distance ... More