Concept

Nearest neighbor search

Related publications (167)

Exploring The Borderlands Of The Gathering Problem

Rachid Guerraoui, El Mahdi El Mhamdi, Alexandre David Olivier Maurer, Vladislav Tempez

Problems of pattern formation have been extensively studied in distributed computing. One of this problems is the gathering problem: agents must gather at a same position in a distributed manner. When gathering is not possible, a close problem is the conve ...

2019

Modelling the Syntax of North Indian Melodies with a Generalized Graph Grammar

Martin Alois Rohrmeier, Christoph Finkensiep

Hierarchical models of music allow explanation of highly complex musical structure based on the general principle of recursive elaboration and a small set of orthogonal operations. Recent approaches to melodic elaboration have converged to a representation ...

ISMIR2019

Determination and evaluation of the nonadditivity in wetting of molecularly heterogeneous surfaces

Francesco Stellacci, Michele Ceriotti, Sylvie Roke, Quy Ong Khac, Halil Ibrahim Okur, David Mark Wilkins, Zhi Luo, Anna Murello, Filip Kovacik

The interface between water and folded proteins is very complex. Proteins have "patchy" solvent-accessible areas composed of domains of varying hydrophobicity. The textbook understanding is that these domains contribute additively to interfacial properties ...

PNAS2019

Taster: Self-Tuning, Elastic and Online Approximate Query Processing

Anastasia Ailamaki, Raja Appuswamy, Matthaios Alexandros Olma, Odysseas Papapetrou

Current Approximate Query Processing (AQP) engines are far from silver-bullet solutions, as they adopt several static design decisions that target specific workloads and deployment scenarios. Offline AQP engines target deployments with large storage budget ...

IEEE2019

On the Impact of Uncertainty for Path Planning

We consider the problem of planning paths on graphs with some edges whose traversability is uncertain; for each uncertain edge, we are given a probability of being traversable (e.g., by a learned classifier). We categorize different interpretations of the ...

2019

An Optimal Planning Framework to Deploy Self-Reconfigurable Modular Robots

Auke Ijspeert, Mehmet Hasan Mutlu, Simon Lukas Hauser, Hala Khodr, Alexandre Bernardino

Self-reconfiguration is a hard problem due to the high dimensionality of self-reconfigurable modular systems. Searchbased approaches offer complete and optimal solutions. However, naive search algorithms cannot directly solve self-reconfiguration tasks in ...

2019

Towards Measuring the Amount of Discriminatory Information in Finger Vein Biometric Characteristics Using a Relative Entropy Estimator

Sébastien Marcel

This chapter makes the first attempt to quantify the amount of discriminatory information in finger vein biometric characteristics in terms of Relative Entropy (RE) calculated on genuine and impostor comparison scores using a Nearest Neighbour (NN) estimat ...

Springer Open2019

Drone Shadow Tracking

Sabine Süsstrunk, Majed El Helou, Ruofan Zhou

Aerial videos taken by a drone not too far above the surface may contain the drone's shadow projected on the scene. This deteriorates the aesthetic quality of videos. With the presence of other shadows, shadow removal cannot be directly applied, and the sh ...

2019

Topological states on the breathing kagome lattice

Adrien Bolens

We theoretically study the topological properties of the tight-binding model on the breathing kagome lattice with antisymmetric spin-orbit coupling (SOC) between nearest neighbors. We show that the system hosts nontrivial topological phases even without se ...

2019

Efficient Bundled Spatial Range Queries

Anastasia Ailamaki, Darius Sidlauskas, Thomas Heinis, Farhan Tauheed, Eleni Tzirita Zacharatou

Efficiently querying multiple spatial data sets is a growing challenge for scientists. Astronomers query data sets that contain different types of stars (e.g., dwarfs, giants, stragglers) while neuroscientists query different data sets that model different ...

ASSOC COMPUTING MACHINERY2019

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.