Publication

Compression with Graphical Constraints: An Interactive Browser

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.

Efficient Concurrent Analytical Query Processing using Data and Workload-conscious Sharing

Panagiotis Sioulas

Analytical workloads are evolving as the number of users surges and applications that submit queries in batches become popular. However, traditional analytical databases that optimize-then-execute each query individually struggle to provide timely response ...

EPFL2023

Computing the count of distinct elements in large data sets is a common task but naive approaches are memory-expensive. The HyperLogLog (HLL) algorithm (Flajolet et al., 2007) estimates a data set's cardinality while using significantly less memory than a ...

IEEE COMPUTER SOC2022

Imputation of missing information in worldwide patent data

Gaétan Jean A de Rassenfosse

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

ELSEVIER2021

Nowadays, massive amounts of point cloud data can be collected thanks to advances in data acquisition and processing technologies such as dense image matching and airborne LiDAR scanning. With the increase in volume and precision, point cloud data offers a ...

ASSOC COMPUTING MACHINERY2019

Database Alignment with Gaussian Features

Negar Kiyavash, Osman Emre Dai

We consider the problem of aligning a pair of databases with jointly Gaussian features. We consider two algorithms, complete database alignment via MAP estimation among all possible database alignments, and partial alignment via a thresholding approach of ...

MLR Press2019

, ,

Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary to practically solve the problem of nearest neighbor search. In this pap ...

ASSOC COMPUTING MACHINERY2018

Nowadays, massive amounts of point cloud data can be collected thanks to advances in data acquisition and processing technologies like dense image matching and airborne LiDAR (Light Detection and Ranging) scanning. With the increase in volume and precision ...

2017

Room acoustics refers to the audio capture of an enclosed room. It can be seen as its color and fully describes the characteristics of the room, including the shape, size or the population. The goal of the project is to set up a database of Room impulse re ...

2016

Distinguishing Crowd Dynamics in Small Teams: A Crowdsourcing Exercise in Higher Education

Christopher Tucci, Gianluigi Viscusi

Folk wisdom usually takes the number of participants as an often necessary and sufficient condition for identifying a crowd. This assumption has diffused among academics interested in crowdsourcing and collective intelligence as well. Yet, consider 50 peop ...

2016

, , ,

As data collections become larger and larger, users are faced with increasing bottlenecks in their data analysis. More data means more time to prepare and to load the data into the database before executing the desired queries. Many applications already av ...

Assoc Computing Machinery2015