Publications related to Computably enumerable set

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 ...

New York2023

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

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Viktor Kuncak, Simon Guilloud

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

Springer2022

Genetic-optimised aperiodic code for distributed optical fibre sensors

Luc Thévenaz, Marcelo Alfonso Soto Hernandez, Zhisheng Yang, Simon Adrien Zaslawski, Sheng Wang, Jian Wu

Distributed optical fibre sensors deliver a map of a physical quantity along an optical fibre, providing a unique solution for health monitoring of targeted structures. Considerable developments over recent years have pushed conventional distributed sensor ...

2020

Robust Adaptive Decision Making: Bayesian Optimization and Beyond

Ilija Bogunovic

The central task in many interactive machine learning systems can be formalized as the sequential optimization of a black-box function. Bayesian optimization (BO) is a powerful model-based framework for \emph{adaptive} experimentation, where the primary go ...

EPFL2019

Enumeration of Border-Strip Decompositions and Weil-Petersson Volumes

Linus Jordan

We describe an injection from border-strip decompositions of certain diagrams to permutations. This allows us to provide enumeration results as well as q-analogues of enumeration formulas. Finally, we use this injection to prove a connection between the nu ...

2019

Retaining data from streams of social platforms with minimal regret

Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Chi Thang Duong

Today's social platforms, such as Twitter and Facebook, continuously generate massive volumes of data. The resulting data streams exceed any reasonable limit for permanent storage, especially since data is often redundant, overlapping, sparse, and generall ...

2017

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Historical Map of Albanian Villages: a Tool for Harmonizing Census Data throughout the 20th Century

Martin Schuler, Alain Nicolas Jarne

The present article deals with conceptual and methodological questions at the base of a research project of settlement history of Albania in the 20th century. We focus our interest on the identification of all local units and their population. In order to ...

2017

Enumeration of reversible functions and its application to circuit complexity

Giovanni De Micheli, Mathias Soeken, Nabila Abdessaied

We review combinational results to enumerate and classify reversible functions and investigate the application to circuit complexity. In particularly, we consider the effect of negating and permuting input and output variables and the effect of applying li ...

Springer2016

Computably enumerable set

Graph Chatbot

Chat with Graph Search

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

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

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Genetic-optimised aperiodic code for distributed optical fibre sensors

Robust Adaptive Decision Making: Bayesian Optimization and Beyond

Enumeration of Border-Strip Decompositions and Weil-Petersson Volumes

Retaining data from streams of social platforms with minimal regret

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Historical Map of Albanian Villages: a Tool for Harmonizing Census Data throughout the 20th Century

Enumeration of reversible functions and its application to circuit complexity

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

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

Genetic-optimised aperiodic code for distributed optical fibre sensors

Enumeration of reversible functions and its application to circuit complexity

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

Robust Adaptive Decision Making: Bayesian Optimization and Beyond

Historical Map of Albanian Villages: a Tool for Harmonizing Census Data throughout the 20th Century

Retaining data from streams of social platforms with minimal regret

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Enumeration of Border-Strip Decompositions and Weil-Petersson Volumes