Concept

Binary space partitioning

Related publications (29)

Graph Chatbot

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.

Fairness and Explainability in Clustering Problems

Xinrui Jia

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

EPFL2023

Sublinear Algorithms for Spectral Graph Clustering

Aidasadat Mousavifar

This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...

EPFL2021

The diffusion limit of kinetic systems has been subject of numerous studies since prominent works of Lebowitz et al. [1] and van Kampen [2]. More recently, the topic has seen a fresh interest from the rarefied gas simulation perspective. In particular, Fok ...

2021

Context. The extensive stellar spectroscopic datasets that are available for studies in Galactic Archeaology thanks to, for example, the Gaia-ESO Survey, now benefit from having a significant number of targets that overlap with asteroseismology projects su ...

EDP SCIENCES S A2020

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Hakan Gökcesu, Kaan Gökcesu

We propose an online algorithm for sequential learning in the contextual multiarmed bandit setting. Our approach is to partition the context space and, then, optimally combine all of the possible mappings between the partition regions and the set of bandit ...

2019

New Results On The Pseudoredundancy

Zihui Liu

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding ...

2019

Benchmarking of Objective Quality Metrics for Colorless Point Clouds

Touradj Ebrahimi, Evangelos Alexiou

Recent advances in depth sensing and display technologies, along with the significant growth of interest for augmented and virtual reality applications, lay the foundation for the rapid evolution of applications that provide immersive experiences. In such ...

IEEE2018

Multi-plane super-resolution microscopy

Azat Sharipov

Understanding cell functions is the major goal of molecular biology, which intends to elucidate the interactions between biomolecules at a subcellular level. One of the widely used techniques in molecular biology is fluorescence microscopy, which offers hi ...

EPFL2017

Many software systems consist of data processing components that analyse large datasets to gather information and learn from these. Often, only part of the data is relevant for analysis. Data processing systems contain an initial preprocessing step that fi ...

EPFL2016

This paper addresses the problems of disparity and optical flow partitioning based on the brightness invariance assumption. We investigate new variational approaches to these problems with Potts priors and possibly box constraints. For the optical flow par ...

IMA2015