Publications related to Merge algorithm

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

Cycles are one of the fundamental subgraph patterns and being able to enumerate them in graphs enables important applications in a wide variety of fields, including finance, biology, chemistry, and network science. However, to enable cycle enumeration in r ...

Assoc Computing Machinery2023

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

arXiv2023

Learning in Volatile Environments With the Bayes Factor Surprise

Wulfram Gerstner, Johanni Michael Brea, Alireza Modirshanechi, Vasiliki Liakoni

Surprise-based learning allows agents to rapidly adapt to nonstationary stochastic environments characterized by sudden changes. We show that exact Bayesian inference in a hierarchical model gives rise to a surprise-modulated trade-off between forgetting o ...

MIT PRESS2021

Recursive blocked algorithms for linear systems with Kronecker product structure

Daniel Kressner

Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to higher-dimensional variants of g ...

SPRINGER2020

Merging into Single-Lane Roundabouts in the Presence of Uncertainty

Denis Gillet, Ezequiel González Debada

Merging efficiently into roundabouts represents a challenge for autonomous vehicles due to the speed difference between merging traffic flows and the lack of certainty regarding drivers' intent, specially when the road is shared with human drivers and/or i ...

2019

Particle number control for direct simulation Monte-Carlo methodology using kernel estimates

Mohammadhossein Gorji

The efficiency of stochastic particle schemes for large scale simulations relies on the ability to preserve a uniform distribution of particles in the whole physical domain. While simple particle split and merge algorithms have been considered previously, ...

2019

Round Compression for Parallel Matching Algorithms

Slobodan Mitrovic, Aleksander Madry

For over a decade now we have been witnessing the success of massive parallel computation (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for their success is the fact that these frameworks are able to accurately capture th ...

ASSOC COMPUTING MACHINERY2018

Current Trends in Multidrug Optimization: An Alley of Future Successful Treatment of Complex Disorders

Patrycja Nowak-Sliwinska

The identification of effective and long-lasting cancer therapies still remains elusive, partially due to patient and tumor heterogeneity, acquired drug resistance, and single-drug dose-limiting toxicities. The use of drug combinations may help to overcome ...

Sage Publications Inc2017

Parallel algorithms for tensor completion in the CP format

Daniel Kressner, André Uschmajew

Low-rank tensor completion addresses the task of filling in missing entries in multidimensional data. It has proven its versatility in numerous applications, including context aware recommender systems and multivariate function learning. To handle large-sc ...

Elsevier Science Bv2016

A small-scale hyperacute compound eye featuring active eye tremor: application to visual stabilization, target tracking, and short-range odometry

Dario Floreano

In this study, a miniature artificial compound eye (15 mm in diameter) called the curved artificial compound eye (CurvACE) was endowed for the first time with hyperacuity, using similar micro-movements to those occurring in the fly's compound eye. A period ...

Iop Publishing Ltd2015

Merged neutral beams

Andreas Osterwalder

A detailed description of a merged beam apparatus for the study of low energy molecular scattering is given. This review is intended to guide any scientist who plans to construct a similar experiment, and to provide some inspiration in describing the appro ...

2015

Merging Inhomogeneous Proximity Sensor Systems for Social Network Analysis

Agon Bexheti, Amir Muaremi

Proximity information is a valuable source for social network analysis. Smartphone based sensors, like GPS, Bluetooth and ANT+, can be used to obtain proximity information between individuals within a group. However, in real-life scenarios, different peopl ...

Springer Int Publishing Ag2014

Efficient Subnetwork Selection in Relay Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

We consider a source that would like to communicate with a destination over a layered Gaussian relay network. We present a computationally efficient method that enables to select a near-optimal (in terms of throughput) subnetwork of a given size connecting ...

Ieee2014

Evidence for major mergers of galaxies at 2 less than or similar to z < 4 in the VVDS and VUDS surveys

Jean-Paul Richard Kneib

Context. The mass assembly of galaxies can proceed through different physical processes. Here we report on the spectroscopic identification of close physical pairs of galaxies at redshifts 2 less than or similar to z < 4 and discuss the impact of major mer ...

EDP Sciences2014

Advantageous State Merging During Symbolic Analysis

George Candea, Johannes Kinder, Volodymyr Kuznetsov, Stefan Bucur

A determination is made regarding whether to merge two symbolic analysis states. A first state corresponds to a first path through a program to a program location and a second state corresponds to a second path through the program to the program location. ...

2013

Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Relationships between entities in datasets are often of multiple types, which can naturally be modeled by a multi-layer graph; a common vertex set represents the entities and the edges on different layers capture different types of relationships between th ...

2013

Complete Completion using Types and Weights

Viktor Kuncak, Ruzica Piskac, Tihomir Gvero, Ivan Kuraj

Developing modern software typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that synthesizes ...

ACM2013

On the spatial partitioning of urban transportation networks

Nikolaos Geroliminis, Yuxuan Ji

It has been recently shown that a macroscopic fundamental diagram (MFD) linking space-mean network flow, density and speed exists in the urban transportation networks under some conditions. An MFD is further well defined if the network is homogeneous with ...

Elsevier2012

A 10-bit 50-MS/s Redundant SAR ADC with Split Capacitive-Array DAC

Yusuf Leblebici, Mehdi Saberi

A new architecture for successive-approximation register analog-to-digital converters (SAR ADC) using generalized non-binary search algorithm is proposed to reduce the complexity and power consumption of the digital circuitry. The proposed architecture is ...

Springer Verlag2012

Structured Derivation of Semi-Synchronous Algorithms

André Schiper, Martin Hutle, Zarko Milosevic, Fatemeh Borran, Hagit Albo Attiya

The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, ...

2011