Publications associées (46)

DynaBurst: Dynamically Assemblying DRAM Bursts over a Multitude of Random Accesses

Paolo Ienne, Mikhail Asiatici

The effective bandwidth of the FPGA external memory, usually DRAM, is extremely sensitive to the access pattern. Nonblocking caches that handle thousands of outstanding misses (miss-optimized memory systems) can dynamically improve bandwidth utilization wh ...
IEEE2019

Pythia: Remote Oracles for the Masses

Mathias Josef Payer, Yuqing Zhang

Remote Direct Memory Access (RDMA) is a technology that allows direct access from the network to a machine's main memory without involving its CPU. RDMA offers low-latency, high-bandwidth performance and low CPU utilization. While RDMA provides massive per ...
USENIX ASSOC2019

Origin of enhancement in Raman scattering from Ag-dressed carbon-nanotube antennas: experiment and modelling

Olivier Martin

The D- and G-band Raman signals from random arrays of vertically aligned, multi-walled carbon nanotubes are significantly enhanced (up to ∼14×) while the signal from the underlying Si substrate is simultaneously attenuated (up to ∼6×) when the nanotubes ar ...
2018

Performance metrics and enabling technologies for nanoplasmonic biosensors

Hatice Altug

Nanoplasmonic structures can tightly confine light onto a material's surface to probe biomolecular interactions not easily accessed by other sensing techniques. New and exciting developments in nanofabrication processes, nano-optical trapping, graphene dev ...
2018

Multilevel tensor approximation of PDEs with random data

Daniel Kressner, Jonas Ballani, Michael Dieter Peters

In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of random diffusion problems. Using a standard stochastic collocation scheme, we first approximate the infinite dimensional random problem by a deterministic parame ...
Springer2017

Scalable greedy algorithms for transfer learning

Barbara Caputo, Ilja Kuzborskij

In this paper we consider the binary transfer learning problem, focusing on how to select and combine sources from a large pool to yield a good performance on a target task. Constraining our scenario to real world, we do not assume the direct access to the ...
2017

Turbulent Flows within Random Arrays of Rigid and Emergent Cylinders with Varying Distribution

Mário Jorge Rodrigues Pereira Da Franca, Ana Margarida Da Costa Ricardo

The spatial distribution of emergent vegetation in rivers is frequently nonuniform. Here, spatial nonuniformity is simulated in the laboratory by varying longitudinally the stem areal number density (m). Time- and space-averaged flow variables, correspondi ...
Asce-Amer Soc Civil Engineers2016

Efficient Algorithms for the Data Exchange Problem

Michael Christoph Gastpar, Sameer Pawar

In this paper, we study the data exchange problem, where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-inform ...
Institute of Electrical and Electronics Engineers2016

Enantioselective palladium(0)-catalyzed intramolecular cyclopropane functionalization: access to dihydroquinolones, dihydroisoquinolones and the BMS-791325 ring system

Nicolai Cramer, Tanguy Jean Daniel Saget, Pavel Alexandrovich Donets, Julia Pedroni

Taddol-based phosphoramidite ligands enable enantioselective palladium(0)-catalyzed C-H arylation of cyclopropanes. The cyclized products are obtained in high yields and enantioselectivities. The reported method provides efficient access to a broad range o ...
Royal Soc Chemistry2015

Error Analysis of the Dynamically Orthogonal Approximation of Time Dependent Random PDEs

Fabio Nobile, Eleonora Musharbash

In this work we discuss the dynamically orthogonal (DO) approximation of time dependent partial differential equations with random data. The approximate solution is expanded at each time instant on a time dependent orthonormal basis in the physical domain ...
2015

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.