Concept

Computational resource

Publications associées (134)

Linear Scalability of Distributed Applications

The explosion of social applications such as Facebook, LinkedIn and Twitter, of electronic commerce with companies like Amazon.com and Ebay.com, and of Internet search has created the need for new technologies and appropriate systems to manage effectively ...

EPFL2012

MEU – A cartographic-based web-platform for urban energy management and planning

Gaëtan Cherix, Massimiliano Capezzali

This paper presents MEU (http://meu.epfl.ch) project results: a new GIS-centric web application for energy management and planning of existing or new urban zones. The project has been carried out with the collaboration of four Western Switzerland cities an ...

2012

Fast Speaker Verification on Mobile Phone data using Boosted Slice Classifiers

Sébastien Marcel, Anindya Roy

In this work, we investigate a novel computationally efficient speaker verification (SV) system involving boosted ensembles of simple threshold-based classifiers. The system is based on a novel set of features called “slice features”. Both the system and t ...

2011

"Gold standard" coupled-cluster study of acetylene pentamers and hexamers via molecular tailoring approach

Brijesh Kumar Mishra

Due to high scaling order of MP2 and CCSD(T) methods, it is either difficult or at times even impossible to treat even moderately sized molecular systems with elaborate basis sets such as aug-cc-pVXZ (X = D, T, Q). In the present work, several structures o ...

2011

Filter Learning for Linear Structure Segmentation

Pascal Fua, Engin Türetken, Vincent Lepetit, Germán González Serrano, Roberto Rigamonti

We introduce an approach to learning convolution filters whose joint output can be fed to a classifier that labels them as belonging to linear structures or not. The filters are learned using sparse synthesis techniques but we show that enforcing constrain ...

2011

Computational analysis of protein-DNA interactions from ChIP-seq data

Felix Naef, Jacques Rougemont

Chromatin immunoprecipitation experiments followed by ultra-high-throughput sequencing (ChIP-seq) is becoming the method of choice to identify transcription factor binding sites in prokaryotes and eukaryotes in vivo. Here, we review the computational steps ...

2011

Reconstruction of Large, Irregularly Sampled Multidimensional Images. A Tensor-Based Approach

Michaël Unser

Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this problem; the currently available methods, however, are hard to deploy for large-scale inter ...

IEEE2011

Clearing the Clouds: A Study of Emerging Workloads on Modern Hardware

Anastasia Ailamaki, Babak Falsafi, Michael Ferdman, Mohammad Alisafaee, Yusuf Onur Koçberber, Stavros Volos, Ilknur Cansu Kaynak, Adrian Daniel Popescu, Al Mutaz Adileh

Emerging scale-out cloud applications need extensive amounts of computational resources. However, data centers using modern server hardware face physical constraints in space and power, limiting further expansion and calling for improvements in the computa ...

2011

Deterministic characterization of phase noise in biomolecular oscillators

Marc Hafner

On top of the many external perturbations, cellular oscillators also face intrinsic perturbations due the randomness of chemical kinetics. Biomolecular oscillators, distinct in their parameter sets or distinct in their architecture, show different resilien ...

2011

Predictable performance and high query concurrency for data analytics

George Candea

Conventional data warehouses employ the query- at-a-time model, which maps each query to a distinct physical plan. When several queries execute concurrently, this model introduces contention and thrashing, because the physical plans—unaware of each other—c ...

2011

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