Publications associées à Recherche dichotomique

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

INFORMS2017

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

Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms

Rachid Guerraoui, Vasileios Trigonakis, Karolos Antoniadis, Julien Michel Stainer

Establishing the scalability of a concurrent algorithm a priori, before implementing and evaluating it on a concrete multi-core platform, seems difficult, if not impossible. In the context of search data structures however, according to all practical work ...

Springer International Publishing2017

Mapping and classifying molecules from a high-throughput structural database

Michele Ceriotti, Félix Benedito Clément Musil, Sandip De, Teresa Ingram, Carsten Baldauf

High-throughput computational materials design promises to greatly accelerate the process of discovering new materials and compounds, and of optimizing their properties. The large databases of structures and properties that result from computational search ...

Biomed Central Ltd2017

Efficient and Secure Outsourcing of Genomic Data Storage

Jean-Pierre Hubaux, Jean Louis Raisaro, Zhicong Huang, Joao André Gomes de Sá e Sousa

Cloud computing is becoming the preferred solution for efficiently dealing with the increasing amount of genomic data. Yet, outsourcing storage and processing of sensitive data, such as genomic data, comes with important concerns related to privacy and sec ...

Cryptology ePrint Archive: Report 2017/2282017

Perceiving learning at a glance: A systematic literature review of learning dashboard research

Pierre Dillenbourg, Denis Gillet, Maria Jesus Rodriguez Triana, Adrian Christian Holzer, Andrii Vozniuk, Beat Adrian Schwendimann, Mina Shirvani Boroujeni

This paper presents a systematic literature review of the state-of-the-art of research on learning dashboards in the fields of Learning Analytics and Educational Data Mining. Research on learning dashboards aims to identify what data is meaningful to diffe ...

Institute of Electrical and Electronics Engineers2017

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Recherche dichotomique

Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs

A single-phase, proximal path-following framework

Elastic transactions

Interleaving with Coroutines: A Practical Approach for Robust Index Joins

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

Tracking Transmission of Details in Paintings

Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms

Mapping and classifying molecules from a high-throughput structural database

Efficient and Secure Outsourcing of Genomic Data Storage

Perceiving learning at a glance: A systematic literature review of learning dashboard research

Graph Chatbot

Chattez avec Graph Search

Elastic transactions

Interleaving with Coroutines: A Practical Approach for Robust Index Joins

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

Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs

Efficient and Secure Outsourcing of Genomic Data Storage

A single-phase, proximal path-following framework

Tracking Transmission of Details in Paintings

Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms

Mapping and classifying molecules from a high-throughput structural database

Perceiving learning at a glance: A systematic literature review of learning dashboard research