Clustering and Informative Path Planning for 3D Gas Distribution Mapping: Algorithms and Performance Evaluation

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (29)

Robust discrete choice models with t-distributed kernel errors

Michel Bierlaire, Prateek Bansal, Thomas Gasos

Outliers in discrete choice response data may result from misclassification and misreporting of the response variable and from choice behaviour that is inconsistent with modelling assumptions (e.g. random utility maximisation). In the presence of outliers, ...

2023

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

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

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Bayesian reconstruction of memories stored in neural networks from their connectivity

Florent Gérard Krzakala, Lenka Zdeborová

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

2023

Unsupervised Graph Representation Learning with Cluster-aware Self-training and Refining

Qiang Liu, Feng Yu, Yichen Xu

Unsupervised graph representation learning aims to learn low-dimensional node embeddings without supervision while preserving graph topological structures and node attributive features. Previous Graph Neural Networks (GNN) require a large number of labeled ...

Assoc Computing Machinery2023

Studies on EU-DEMO 3D coils requirements and conceptual design for error field correction and plasma control

Pierluigi Bruzzone, Hartmut Zohm, Leonardo Pigatto

This work presents the initial studies on the requirements for the design of 3D coils on EU-DEMO. The use of 3D coils in present machines includes two main purposes: the first one is the Error Field Correction (EFC). The EFC aims at minimizing the intrinsi ...

Elsevier Science Sa2023

A geometric optimal control approach for imitation and generalization of manipulation skills

Sylvain Calinon, Amirreza Razmjoo Fard, Jie Zhao

Daily manipulation tasks are characterized by regular features associated with the task structure, which can be described by multiple geometric primitives related to actions and object shapes. Only using Cartesian coordinate systems cannot fully represent ...

Elsevier2023

Feature distribution learning by passive exposure

Gizay Ceylan, David Pascucci

Humans can rapidly estimate the statistical properties of groups of stimuli, including their average and variability. But recent studies of so-called Feature Distribution Learning (FDL) have shown that observers can quickly learn even more complex aspects ...

2022

Page 2 sur 2