Recherche dichotomique

Science formelle
Informatique théorique
Algorithme
Analyse de la complexité de...

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (28)

A Novel Method for Sampling Bandlimited Graph Signals

Pascal Frossard, Pinar Akyazi, Dion Eustathios Olivier Tzamarias

In this paper we propose a novel vertex based sampling method for k-bandlimited signals lying on arbitrary graphs, that has a reasonable computational complexity and results in low reconstruction error. Our goal is to find the smallest set of vertices that ...

IEEE COMPUTER SOC2018

Practical Private Range Search in Depth

Odysseas Papapetrou, Ioannis Demertzis

We consider a data owner that outsources its dataset to an untrusted server. The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes on “pr ...

2018

Faster Algorithms for Integer Programs with Block Structure

Friedrich Eisenbrand, Kim-Manuel Klein, Christoph Hunkenschröder

We consider integer programming problems max {c^Tx : A x = b, l

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik2018

A single-phase, proximal path-following framework

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis

We propose a new proximal, path-following framework for a class of---possibly non-smooth---constrained convex problems. We consider settings where the non-smooth part is endowed with a proximity operator, and the constraint set is equipped with a self-conc ...

INFORMS2018

Elastic transactions

Rachid Guerraoui, Vincent Gramoli, Pascal Felber

This paper presents elastic transactions, an appealing alternative to traditional transactions, in particular to implement search structures in shared memory multicore architectures. Upon conflict detection, an elastic transaction might drop what it did so ...

Academic Press Inc Elsevier Science2017

Interleaving with Coroutines: A Practical Approach for Robust Index Joins

Anastasia Ailamaki, Georgios Psaropoulos

Index join performance is determined by the efficiency of the lookup operation on the involved index. Although database indexes are highly optimized to leverage processor caches, main memory accesses inevitably increase lookup runtime when the index outsiz ...

VLDB Endowment Inc.2017

The Pristine survey - III. Spectroscopic confirmation of an efficient search for extremely metal-poor stars

Pascale Jablonka, Marc Gentile

The Pristine survey is a narrow-band, photometric survey focused around the wavelength region of the Ca II H&K absorption lines, designed to efficiently search for extremely metal-poor stars. In this work, we use the first results of amedium-resolution spe ...

Oxford Univ Press2017

Tracking Transmission of Details in Paintings

Frédéric Kaplan, Isabella Di Lenardo, Benoît Laurent Auguste Seguin

In previous articles (di Lenardo et al, 2016; Seguin et al, 2016), we explored how efficient visual search engines operating not on the basis of textual metadata but directly through visual queries, could fundamen- tally change the navigation in large data ...

2017

Page 2 sur 2