On finding approximate nearest neighbours in a set of compressible signals

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.

The growing demand for data-intensive decision support and the migration to multi-tenant infrastructures put databases under the stress of high analytical query load. The requirement for high throughput contradicts the traditional design of query-at-a-time ...

Recent years have witnessed a rise in real-world data captured with rich structural information that can be better depicted by multi-relational or heterogeneous graphs. However, research on relational representation learning has so far mostly focused on th ...

The measurement and classification of light is essential across many scientific disciplines. Devices used to measure light range from the highly precise scanning spectroradiometers to the more practical compact multichannel filter-array type imaging sensor ...

Systems and methods are provided for that use noninvasively measured physiologic parameters to predict in real time noninvasively unobservable cardiovascular parameters by employing a one-dimensional arterial tree numerical model calibrated with representa ...

To improve the accuracy of bifacial gain estimation, recent radiative models of solar energy systems have abandoned the traditional assumption of isotropic ground-reflected radiance. However, surface reflectance itself is still commonly considered as a con ...

We present a general method for imputing missing information in the Worldwide Patent Statistical Database (PATSTAT) and make the resulting datasets publicly available. The PATSTAT database is the de facto standard for academic research using patent data. C ...

The proliferation of phasor measurement units (PMUs) presents new challenges in archiving and processing large amounts of synchrophasor data which necessitates advanced data compression methods. This paper proposes a singular value decomposition (SVD)-base ...

Data cleaning has become an indispensable part of data analysis due to the increasing amount of dirty data. Data scientists spend most of their time preparing dirty data before it can be used for data analysis. Existing solutions that attempt to automate t ...

Recent years have witnessed a rise in real-world data captured with rich structural information that can be conveniently depicted by multi-relational graphs. While inference of continuous node features across a simple graph is rather under-studied by the c ...

On finding approximate nearest neighbours in a set of compressible signals

Chat with Graph Search

Scalable Multi-Query Execution using Reinforcement Learning

Representation Learning for Multi-relational Data

Spectral Measurement and Classification in the Era of Big Data

System and methods for real time noninvasive estimation of cardiovascular parameters

Worldwide performance evaluation of ground surface reflectance models

Imputation of missing information in worldwide patent data

A Real-time Synchrophasor Data Compression Method Using Singular Value Decomposition

Holistic, Efficient, and Real-time Cleaning of Heterogeneous Data

Propagation on Multi-relational Graphs for Node Regression