Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Recherche

Afficher tous les résultats pour

Accueil

Concept

Passage de messages

Applied sciences
Génie informatique
Calcul intensif
Programmation concurrente

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (28)

Page 2 sur 2

Reconstruction using approximate message passing methods

Paul Hurley, Matthieu Martin Jean-André Simeoni

The present invention is notably directed to a computer-implemented method for image reconstruction. The method comprises: accessing elements that respectively correspond to measurement values, which can be respectively mapped to measurement nodes; and per ...

2017

Function Passing: A Model for Typed, Distributed Functional Programming

Philipp Haller, Heather Christine Klug, Jocelyn Boullier

The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model we call function passing designed to provide a more principled substrate on which to build data-centric distributed systems. A key id ...

Assoc Computing Machinery2016

OpenBuildNet Framework for Distributed Co-Simulation of Smart Energy Systems

Colin Neil Jones, Tomasz Tadeusz Gorecki, Faran Ahmed Qureshi, Altug Bitlislioglu, Xuan Truong Nghiem

The complexity and diversity of future energy systems will require co-simulation solutions that enable the integration of tools from multiple domains for research and development. We introduce an open-source framework, OpenBuildNet, for distributed co-simu ...

2016

A Scala Library for Testing Student Assignments on Concurrent Programming

Mikaël Mayer, Ravichandhran Kandhadai Madhavan

We present a lightweight library for testing concurrent Scala programs by systematically exploring multiple interleavings between user-specified operations on shared objects. Our library is targeted at beginners of concurrent programming in Scala, runs on ...

Assoc Computing Machinery2016

Optimal Computational Split-state Non-malleable Codes

Divesh Aggarwal

Non-malleable codes are a generalization of classical error-correcting codes where the act of "corrupting" a codeword is replaced by a "tampering" adversary. Non-malleable codes guarantee that the message contained in the tampered codeword is either the or ...

Springer Int Publishing Ag2016

Simulation Neurotechnologies for Advancing Brain Research: Parallelizing Large Networks in NEURON

Felix Schürmann

Large multiscale neuronal network simulations are of increasing value as more big data are gathered about brain wiring and organization under the auspices of a current major research initiative, such as Brain Research through Advancing Innovative Neurotech ...

Mit Press2016

Asynchronous Decoding of LDPC Codes over BEC

Amin Karbasi, Amir Hesam Salavati, Saeid Haghighatshoar

LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...

2015

Isolates, channels, and event streams for composable distributed programming

Martin Odersky, Aleksandar Prokopec

The actor model has been a model of choice for building reliable distributed systems. On one hand, it ensures that message-processing is serialized within each actor, preserving the familiar sequential programming model. On the other hand, programs written ...

ACM2015