output
20022019
most citedEfficient search by optimized intermittent random walks

65 citations

15 papers

cs.LO2019

Topological Run-time Monitoring for Complex Systems

Matteo Rucco, Luca Tesei, Emanuela Merelli

In this paper we introduce a new data-driven run-time monitoring system for analysing the behaviour of time evolving complex systems. The monitor controls the evolution of the whol…

math.NA2018★ 4 cited

Accelerated PDE's for efficient solution of regularized inversion problems

Minas Benyamin, Jeff Calder, Ganesh Sundaramoorthi +1

We further develop a new framework, called PDE Acceleration, by applying it to calculus of variations problems defined for general functions on , obtaining efficient…

stat.CO2018

Efficient Propagation of Uncertainties in Manufacturing Supply Chains: Time Buckets, L-leap and Multilevel Monte Carlo

Nai-Yuan Chiang, Yinqing Lin, Quan Long

Uncertainty propagation of large scale discrete supply chains can be prohibitive when a large number of events occur during the simulated period and discrete event simulations (DES…

math.SP2018

Spectral Complexity of Directed Graphs and Application to Structural Decomposition

Igor Mezić, Vladimir A. Fonoberov, Maria Fonoberova +1

We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent parts.…

cs.CV2017★ 12 cited

Deep Multimodal Representation Learning from Temporal Data

Xitong Yang, Palghat Ramesh, Radha Chitta +3

In recent years, Deep Learning has been successfully applied to multimodal learning problems, with the aim of learning useful joint representations in data fusion applications. Whe…

cs.DM2017★ 5 cited

Continuous Relaxations for the Traveling Salesman Problem

Tuhin Sahai, Adrian Ziessler, Stefan Klus +1

In this work, we aim to explore connections between dynamical systems techniques and combinatorial optimization problems. In particular, we construct heuristic approaches for the t…

eess.SY2016

Diagnosis and Repair for Synthesis from Signal Temporal Logic Specifications

Shromona Ghosh, Dorsa Sadigh, Pierluigi Nuzzo +5

We address the problem of diagnosing and repairing specifications for hybrid systems formalized in signal temporal logic (STL). Our focus is on the setting of automatic synthesis o…

cs.CV2014★ 31 cited

Multi-modal Sensor Registration for Vehicle Perception via Deep Neural Networks

Michael Giering, Vivek Venugopalan, Kishore Reddy

The ability to simultaneously leverage multiple modes of sensor information is critical for perception of an automated vehicle's physical surroundings. Spatio-temporal alignment of…

cs.DM2014★ 7 cited

A Spectral Assignment Approach for the Graph Isomorphism Problem

Stefan Klus, Tuhin Sahai

In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graph…

cs.CR2014★ 58 cited

Secure Key Establishment for Device-to-Device Communications

Wenlong Shen, Weisheng Hong, Xianghui Cao +3

With the rapid growth of smartphone and tablet users, Device-to-Device (D2D) communications have become an attractive solution for enhancing the performance of traditional cellular…

cond-mat.soft2014

Molecular dynamics simulation of chains mobility in polyethylene crystal

V. I. Sultanov, V. V. Atrazhev, D. V. Dmitriev +1

The mobility of polymer chains in perfect polyethylene (PE) crystal was calculated as a function of temperature and chain length through Molecular dynamics (MD) in united atom appr…

cs.RO2013★ 1 cited

Robust Belief Roadmap: Planning Under Intermittent Sensing

Shaunak D. Bopardikar, Brendan J. Englot, Alberto Speranzon

In this paper, we extend the recent body of work on planning under uncertainty to include the fact that sensors may not provide any measurement owing to misdetection. This is cause…

cond-mat.stat-mech2009★ 65 cited

Efficient search by optimized intermittent random walks

Gleb Oshanin, Katja Lindenberg, Horacio S Wio +1

We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one…

cond-mat.stat-mech2002★ 26 cited

Adsorption of Reactive Particles on a Random Catalytic Chain: An Exact Solution

G. Oshanin, S. F. Burlatsky

We study equilibrium properties of a catalytically-activated annihilation reaction taking place on a one-dimensional chain of length () in which som…

cond-mat.stat-mech2002★ 24 cited

Single-Species Reactions on a Random Catalytic Chain

G. Oshanin, S. F. Burlatsky

We present an exact solution for a catalytically-activated annihilation A + A \to 0 reaction taking place on a one-dimensional chain in which some segments (placed at random, with…