Publications related to An Efficient Parallel Load-Balancing Framework for Orthogonal Decomposition of Geometrical Data

Related publications (14)

Which Coupled is Best Coupled? An Exploration of AIMC Tile Interfaces and Load Balancing for CNNs

David Atienza Alonso, Giovanni Ansaloni, Irem Boybat Kara, Joshua Alexander Harrison Klein

Due to stringent energy and performance constraints, edge AI computing often employs heterogeneous systems that utilize both general-purpose CPUs and accelerators. Analog in-memory computing (AIMC) is a well-known AI inference solution that overcomes compu ...

Institute of Electrical and Electronics Engineers (IEEE)2024

Why the Metric Backbone Preserves Community Structure

Charbel Chucri, Patrick Thiran, Matthias Grossglauser, Maximilien Claude Robert Dreveton

The metric backbone of a weighted graph is the union of all-pairs shortest paths. It is obtained by removing all edges

(u,v)

that are not the shortest path between

u

and

v

. In networks with well-separated communities, the metric backbone tends to pre ...

2024

A recipe for cracking the quantum scaling limit with machine learned electron densities

Mario Geiger

A long-standing goal of science is to accurately simulate large molecular systems using quantum mechanics. The poor scaling of current quantum chemistry algorithms on classical computers, however, imposes an effective limit of about a few dozen atoms on tr ...

IOP Publishing Ltd2023

A Hyperspectral Space of Skin Tones for Inverse Rendering of Biophysical Skin Properties

Mengqi Xia

We present a method for estimating the main properties of human skin, leveraging a hyperspectral dataset of skin tones synthetically generated through a biophysical layered skin model and Monte Carlo light transport simulations. Our approach learns the map ...

2023

Architecture Exploration and Optimization of Heterogeneous Many-Core Compute and Memory Architectures with Architectural Extensions

Yasir Mahmood Qureshi

The expeditious proliferation of Internet connectivity and the growing adoption of digital products have transformed various spheres of our everyday lives. This increased digitization of society has led to the emergence of new applications, which are deplo ...

EPFL2021

A Game-Theoretic Analysis of Cross-Chain Atomic Swaps with HTLCs

Jiahua Xu

To achieve interoperability between unconnected ledgers, hash time lock contracts (HTLCs) are commonly used for cross-chain asset exchange. The solution tolerates transaction failure, and can "make the best out of worst" by allowing transacting agents to a ...

IEEE COMPUTER SOC2021

Probabilistic and temporal failure detectors for solving distributed problems

Rachid Guerraoui

Failure detectors (FD)s are celebrated for their modularity in solving distributed problems. Algorithms are constructed using FD building blocks. Synchrony assumptions to implement FDs are studied separately and are typically expressed as eventual guarante ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

Existence of dynamical low rank approximations for random semi-linear evolutionary equations on the maximal interval

Fabio Nobile, Yoshihito Kazashi

An existence result is presented for the dynamical low rank (DLR) approximation for random semi-linear evolutionary equations. The DLR solution approximates the true solution at each time instant by a linear combination of products of deterministic and sto ...

2021

Reconfigurable Timed Discrete-Event Systems

Matin Macktoobian

In this paper, we present the first general solution to the automatic reconfiguration problem of timed discrete-event systems. We extend the recursive forcible backtracking approach which had been already solved the automatic reconfiguration problem of unt ...

IEEE2020

SciLens News Platform: A System for Real-Time Evaluation of News Articles

Karl Aberer, Panagiotis Smeros, Angeliki Romanou

We demonstrate the SciLens News Platform, a novel system for evaluating the quality of news articles. The SciLens News Platform automatically collects contextual information about news articles in real-time and provides quality indicators about their valid ...

ASSOC COMPUTING MACHINERY2020

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Building Evolvable Networks : Flexible and Predictable Packet Processing

Mihai Dobrescu

Software packet-processing platforms- - network devices running on general-purpose servers-- are emerging as a compelling alternative to the traditional high-end switches and routers running on specialized hardware. Their promise is to enable the fast dep ...

EPFL2015

Power/Performance Exploration of Single-core and Multi-core Processor Approaches for Biomedical Signal Processing

David Atienza Alonso, Andreas Peter Burg, Luca Benini, Ahmed Yasir Dogan

This study presents a single-core and a multi-core processor architecture for health monitoring systems where slow biosignal events and highly parallel computations exist. The single-core architecture is composed of a processing core (PC), an instruction m ...

Springer-Verlag Heidelberg2011

Mesoscale and clusters of synchrony in networks of bursting neurons

Martin Hasler, Igor Belykh

We study the role of network architecture in the formation of synchronous clusters in synaptically coupled networks of bursting neurons. We give a simple combinatorial algorithm that finds the largest synchronous clusters from the network topology. We demo ...

American Institute of Physics2011