Concept

Von Neumann universe

Related publications (16)

EdgeAI-Aware Design of In-Memory Computing Architectures

Driven by the demand for real-time processing and the need to minimize latency in AI algorithms, edge computing has experienced remarkable progress. Decision-making AI applications stand out for their heavy reliance on data-centric operations, predominantl ...

EPFL2024

Parabolic stochastic PDEs on bounded domains with rough initial conditions: moment and correlation bounds

Le Chen, Cheuk Yin Lee, David Jean-Michel Candil

We consider nonlinear parabolic stochastic PDEs on a bounded Lipschitz domain driven by a Gaussian noise that is white in time and colored in space, with Dirichlet or Neumann boundary condition. We establish existence, uniqueness and moment bounds of the r ...

New York2023

Nonvolatile Memory Crossbar Arrays for Non-von Neumann Computing

Irem Boybat Kara, Severin Sidler, Carmelo Di Nolfo

In the conventional von Neumann (VN) architecture, data—both operands and operations to be performed on those operands—makes its way from memory to a dedicated central processor. With the end of Dennard scaling and the resulting slowdown in Moore’s law, th ...

Springer India2017

A Comparison of Preconditioners for the Steklov–Poincaré Formulation of the Fluid-Structure Coupling in Hemodynamics

Alfio Quarteroni, Simone Deparis, Davide Forti

A Fluid–Structure Interaction (FSI) problem can be reinterpreted as a heterogeneous problem with two subdomains. It is possible to describe the coupled problem at the interface between the fluid and the structure, yielding a nonlinear Steklov–Poincaré prob ...

2015

Integrable Systems of Neumann Type

Tudor Ratiu

We construct families of integrable systems that interpolate between -dimensional harmonic oscillators and Neumann systems. This is achieved by studying a family of integrable systems generated by the Casimir functions of the Lie algebra of real skew-symme ...

Springer Verlag2015

CoFeed: privacy-preserving Web search recommendation based on collaborative aggregation of interest feedback

Martin Rajman, Vinh Toan Luu, Pascal Felber

Search engines essentially rely on the structure of the graph of hyperlinks. Although accurate for the main trend, this is not effective when some query is ambiguous. Leveraging semantic information by the mean of interest matching allows proposing complem ...

Wiley-Blackwell2013

A class of Neumann type systems and its application

Jinbing Chen

A class of Neumann type systems are derived separating the spatial and temporal variables for the 2+1 dimensional Caudrey-Dodd-Gibbon-Kotera-Sawada (CDGKS) equation and the modified Korteweg-de Vries (mKdV) hierarchy. The Lax-Moser matrix of Neumann type s ...

International Press2012

Some algebro-geometric solutions for the coupled modified Kadomtsev-Petviashvili equations arising from the Neumann type systems

Jinbing Chen

A treatment is described for getting some algebro-geometric solutions of the coupled modified Kadomtsev-Petviashvili (cmKP) equations and a hierarchy of 1 + 1 dimensional integrable nonlinear evolution equations (INLEEs) by using the Neumann type systems t ...

American Institute of Physics2012

A stochastic reach-avoid problem with random obstacles

Maryam Kamgarpour, John Lygeros

We present a dynamic programming based solution to a stochastic reachability problem for a controlled discrete-time stochastic hybrid system. A sum-multiplicative cost function is introduced along with a corresponding dynamic recursion which quantifies the ...

ACM Press2011

From Set Membership to Group Membership: A Separation of Concerns

André Schiper

We revisit the well-known group membership problem and show how it can be considered a special case of a simple problem, the set membership problem. In the set membership problem, processes maintain a set whose elements are drawn from an arbitrary universe ...

2006

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.