Concept

NTFS

Publications associées (13)

What determines the temporal extent of unconscious feature integration?

Michael Herzog, Leila Drissi Daoudi - Kleinbauer, Lukas Vogelsang

Visual features are spatiotemporally integrated along motion trajectories. For instance, when a central line is followed by pairs of flanking lines, two motion streams diverging from the center are perceived. The central line is rendered unconscious by the ...

2021

Visual feature integration: how long can it last?

Michael Herzog, Leila Drissi Daoudi - Kleinbauer, Lukas Vogelsang

Spatiotemporal features are integrated along motion trajectories. For example, when a central line is followed by pairs of flanking lines, two motion streams diverging from the center are perceived. The central line is rendered invisible by the subsequent ...

SAGE Publishing2021

Oblivious Dynamic Searchable Encryption on Distributed Cloud Systems

Fatma Betül Durak

Dynamic Searchable Symmetric Encryption (DSSE) allows search/update operations over encrypted data via an encrypted index. However, DSSE has been shown to be vulnerable to statistical inference attacks, which can extract a significant amount of information ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

A kernel compression scheme for fractional differential equations

Jan Sickmann Hesthaven, Daniel Henri Baffet

The nonlocal nature of the fractional integral makes the numerical treatment of fractional dierential equations expensive in terms of computational eort and memory requirements. In this paper we propose a method to reduce these costs while controlling the ...

Society for Industrial and Applied Mathematics2017

Chaos: Scale-out Graph Processing from Secondary Storage

Willy Zwaenepoel, Laurent Bindschaedler, Amitabha Roy, Jasmina Malicevic

Chaos scales graph processing from secondary storage to multiple machines in a cluster. Earlier systems that process graphs from secondary storage are restricted to a single ma- chine, and therefore limited by the bandwidth and capacity of the storage syst ...

2015

Energy-efficient Continuous Context Sensing on Mobile Phones

Julien Eberle

With the ever increasing adoption of smartphones worldwide, researchers have found the perfect sensor platform to perform context-based research and to prepare for context-based services to be also deployed for the end-users. However, continuous context se ...

EPFL2015

ALLARM: Optimizing Sparse Directories for Thread-Local Data

Amitabha Roy

Large-scale cache-coherent systems often impose unnecessary overhead on data that is thread-private for the whole of its lifetime. These include resources devoted to tracking the coherence state of the data, as well as unnecessary coherence messages sent o ...

2014

GPUfs: Integrating a File System with GPUs

Bryan Alexander Ford

As GPU hardware becomes increasingly general-purpose, it is quickly outgrowing the traditional, constrained GPU-as-coprocessor programming model. To make GPUs easier to program and improve their integration with operating systems, we propose making the hos ...

2013

MPTCP is not Pareto-Optimal: Performance Issues and a Possible Solution

Jean-Yves Le Boudec, Nicolas Gabriel Gast, Ramin Khalili, Utkarsh Upadhyay, Miroslav Popovic

MPTCP has been proposed recently as a mechanism for sup- porting transparently multiple connections to the applica- tion layer. It is under discussion at the IETF. We show, however, that the current MPTCP suffers from two prob- lems: (P1) Upgrading some TC ...

2012

Scalable Feature Extraction for Coarse-to-Fine JPEG2000 Image Classification

Pierre Vandergheynst, Christophe De Vleeschouwer, Benoît Macq

In this paper, we address the issues of analyzing and classifying JPEG 2000 code-streams. An original representation, called integral volume, is first proposed to compute local image features progressively from the compressed code-stream, on any spatial im ...

Institute of Electrical and Electronics Engineers2011

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search