Subtree-based bounds and simulation-based estimations for the partition function

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

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

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

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

Facial paralysis is a highly burdening condition, resulting in a patient's inability to move his mimic musculature on one or both sides of his face. This condition compromises the patient's communication and facial expressions, and thus dramatically reduce ...

Field-programmable gate arrays (FPGAs) have become critical components in many cloud computing platforms. These devices possess the fine-grained parallelism and specialization needed to accelerate applications ranging from machine learning to networking an ...

Counting the number of times a patient coughs per day is an essential biomarker in determining treatment efficacy for novel antitussive therapies and personalizing patient care. Automatic cough counting tools must provide accurate information, while runnin ...

Background: Although digital mobility outcomes (DMOs) can be readily calculated from real-world data collected with wearable devices and ad-hoc algorithms, technical validation is still required. The aim of this paper is to comparatively assess and validat ...

In this work, we present, analyze, and implement a class of multilevel Markov chain Monte Carlo(ML-MCMC) algorithms based on independent Metropolis--Hastings proposals for Bayesian inverse problems. In this context, the likelihood function involves solving ...

The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the re-cent years in sparser regimes. Yet, the current techniques still require diverg-ing degrees in order to succe ...

Atrial fibrillation (AF) is the most common cardiac arrhythmia; it will affect one in four adults worldwide in their lifetime. AF has serious consequences, including drastically increased risk of stroke. Catheter ablation surgery is an established treatmen ...

In the field of choice modeling, the availability of ever-larger datasets has the potential to significantly expand our understanding of human behavior, but this prospect is limited by the poor scalability of discrete choice models (DCMs): as sample sizes ...

Higher-order asymptotics provide accurate approximations for use in parametric statistical modelling. In this thesis, we investigate using higher-order approximations in two-specific settings, with a particular emphasis on the tangent exponential model. ...

Subtree-based bounds and simulation-based estimations for the partition function

Chat with Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

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

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Bayesian reconstruction of memories stored in neural networks from their connectivity

Real-time actuation of a dielectric elastomer actuator neuroprosthesis for facial paralysis

A Visionary Look at the Security of Reconfigurable Cloud Computing

A Multimodal Dataset for Automatic Edge-AI Cough Detection

Assessing real-world gait with digital technology? Validation, insights and recommendations from the Mobilise-D consortium

Analysis of a Class of Multilevel Markov Chain Monte Carlo Algorithms Based on Independent Metropolis–Hastings

Learning Sparse Graphons And The Generalized Kesten-Stigum Threshold

Finding information-rich electrocardiographic biomarkers to characterize atrial fibrillation

Stochastic adaptive resampling for the estimation of discrete choice models

Higher Order Asymptotics: Applications to Satellite Conjunction and Boundary Problems