Home

Concept

Nearest neighbor search

Applied sciences
Information engineering
Data science
Dimensionality reduction

About
Privacy
Disclaimer

Graph Chatbot

Related publications (30)

Page 1 of 2

Learning the intrinsic dynamics of spatio-temporal processes through Latent Dynamics Networks

Alfio Quarteroni, Francesco Regazzoni, Stefano Pagani

Predicting the evolution of systems with spatio-temporal dynamics in response to external stimuli is essential for scientific progress. Traditional equations-based approaches leverage first principles through the numerical approximation of differential equ ...

Nature Portfolio2024

Aggregation and Exploration of High-Dimensional Data Using the Sudokube Data Cube Engine

Christoph Koch, Sachin Basil John, Peter Lindner, Zhekai Jiang

We present Sudokube, a novel system that supports interactive speed querying on high-dimensional data using partially materialized data cubes. Given a storage budget, it judiciously chooses what projections to precompute and materialize during cube constru ...

Association for Computing Machinery2023

Robust Collaborative Learning with Linear Gradient Overhead

Rachid Guerraoui, Nirupam Gupta, Rafaël Benjamin Pinot, Le Nguyen Hoang, Sadegh Farhadkhani, John Stephan

Collaborative learning algorithms, such as distributed SGD (or D-SGD), are prone to faulty machines that may deviate from their prescribed algorithm because of software or hardware bugs, poisoned data or malicious behaviors. While many solutions have been ...

PLMR2023

Transfer learning application of self-supervised learning in ARPES

Gabriel Aeppli

There is a growing recognition that electronic band structure is a local property of materials and devices, and there is steep growth in capabilities to collect the relevant data. New photon sources, from small-laboratory-based lasers to free electron lase ...

IOP Publishing Ltd2023

Tractography passes the test: Results from the diffusion-simulated connectivity (disco) challenge

Jean-Philippe Thiran, Alessandro Daducci, Erick Jorge Canales Rodriguez, Gabriel Girard, Marco Pizzolato, Ying-Chia Lin, Juan Luis Villarreal Haro

Estimating structural connectivity from diffusion-weighted magnetic resonance imaging is a challenging task, partly due to the presence of false-positive connections and the misestimation of connection weights. Building on previous efforts, the MICCAI-CDMR ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Stay close, but not too close: aerial image analysis reveals patterns of social distancing in seal colonies

Devis Tuia, Benjamin Alexander Kellenberger

Many species aggregate in dense colonies. Species-specific spatial patterns provide clues about how colonies are shaped by various (a)biotic factors, including predation, temperature regulation or disease transmission. Using aerial imagery, we examined the ...

2023

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

Yunus Inan

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

EPFL2023

Specific Gestalt principles cannot explain (un)crowding

Michael Herzog, Oh-Hyeon Choung, Einat Rashal

The standard physiological model has serious problems accounting for many aspects of vision, particularly when stimulus configurations become slightly more complex than the ones classically used, e.g., configurations of Gabors rather than only one or a few ...

2023

Euclid preparation XXII. Selection of quiescent galaxies from mock photometry using machine learning

Maurizio Martinelli, Frédéric Courbin, Georges Meylan, Gianluca Castignani, Austin Chandler Peel

The Euclid Space Telescope will provide deep imaging at optical and near-infrared wavelengths, along with slitless near-infrared spectroscopy, across similar to 15 000deg(2) of the sky. Euclid is expected to detect similar to 12 billion astronomical source ...

EDP SCIENCES S A2023

Polynomial-time universality and limitations of deep learning

Emmanuel Abbé

The goal of this paper is to characterize function distributions that general neural networks trained by descent algorithms (GD/SGD), can or cannot learn in polytime. The results are: (1) The paradigm of general neural networks trained by SGD is poly-time ...

WILEY2023

Sketches, metrics and fast algorithms

Navid Nouri

As it has become easier and cheaper to collect big datasets in the last few decades, designing efficient and low-cost algorithms for these datasets has attracted unprecedented attention. However, in most applications, even storing datasets as acquired has ...

EPFL2022

On Generalizations of Some Distance Based Classifiers for HDLSS Data

Soham Sarkar

In high dimension, low sample size (HDLSS) settings, classifiers based on Euclidean distances like the nearest neighbor classifier and the average distance classifier perform quite poorly if differences between locations of the underlying populations get m ...

Microtome Publishing2022

Classification of fall directions via wearable motion sensors

Mustafa Sahin Turan

Effective fall-detection and classification systems are vital in mitigating severe medical and economical consequences of falls to people in the fall risk groups. One class of such systems is based on wearable sensors. While there is a vast amount of acade ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

A lightweight learning-based decoding algorithm for intraneural vagus nerve activity classification in pigs

Silvestro Micera, Ivo Strauss, Leonardo Pollina

Objective. Bioelectronic medicine is an emerging field that aims at developing closed-loop neuromodulation protocols for the autonomic nervous system (ANS) to treat a wide range of disorders. When designing a closed-loop protocol for real time modulation o ...

IOP Publishing Ltd2022

Tests of mutual independence among several random vectors using univariate and multivariate ranks of nearest neighbours

Soham Sarkar

Testing mutual independence among several random vectors of arbitrary dimensions is a challenging problem in Statistics, and it has gained considerable interest in recent years. In this article, we propose some nonparametric tests based on different notion ...

TAYLOR & FRANCIS LTD2021

Cluster-and-Conquer: When Randomness Meets Graph Locality

Anne-Marie Kermarrec

K-Nearest-Neighbors (KNN) graphs are central to many emblematic data mining and machine-learning applications. Some of the most efficient KNN graph algorithms are incremental and local: they start from a random graph, which they incrementally improve by tr ...

IEEE COMPUTER SOC2021

Edit Based Grading of SQL Queries

Bikash Chandra

Grading student SQL queries manually is a tedious and error-prone process. Earlier work on testing correctness of student SQL queries, such as the XData system, can be used to test the correctness of a student query. However, in case a student query is fou ...

ASSOC COMPUTING MACHINERY2021

MULLS: Versatile LiDAR SLAM via Multi-metric Linear Least Square

Yujie He

The rapid development of autonomous driving and mobile mapping calls for off-the-shelf LiDAR SLAM solutions that are adaptive to LiDARs of different specifications on various complex scenarios. To this end, we propose MULLS, an efficient, low-drift, and ve ...

IEEE2021

Sequential metric dimension for random graphs

Patrick Thiran, Gergely Odor

In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the least number of distance queries possible. In the j-th step of the game, the player queries a single node v_j and receives, as an answer to their query, th ...

2021

Video Prediction Recalling Long-term Motion Context via Memory Alignment Learning

Hakgu Kim

Our work addresses long-term motion context issues for predicting future frames. To predict the future precisely, it is required to capture which long-term motion context (e.g., walking or running) the input motion (e.g., leg movement) belongs to. The bott ...

IEEE COMPUTER SOC2021