Concept

Simplicity

Related publications (11)

A Simpler and Faster NIC Driver Model for Network Functions

The advent of software network functions calls for stronger correctness guarantees and higher performance at every level of the stack. Current network stacks trade simplicity for performance and flexibility, especially in their driver model. We show that p ...

2021

The simplicity of planar networks

Emanuele Strano, Marc Barthélemy

Shortest paths are not always simple. In planar networks, they can be very different from those with the smallest number of turns - the simplest paths. The statistical comparison of the lengths of the shortest and simplest paths provides a non trivial and ...

Nature Publishing Group2013

Gyroscopic assistance for human balance

Falls are an urgent challenge in aging societies, and balance dysfunction is a major risk factor. Current robotic technology that assists human locomotion, however, aims at versatile functionality, particularly in the assistance of weak muscles. Such versa ...

2012

Suitability of pesticide risk indicators for Less Developed Countries: A comparison

Claudia Rebeca Binder Signer

Pesticide risk indicators provide simple support in the assessment of environmental and health risks from pesticide use, and can therefore inform policies to foster a sustainable interaction of agriculture with the environment. For their relative simplicit ...

Elsevier2011

Modeling perceptual learning: why mice do not play backgammon

Michael Herzog, Elisa Tartaglia, Carl Kristoffer Aberg

Perceptual learning is often considered one of the simplest and basic forms of learning in general. Accordingly, it is usually modeled with simple and basic neural networks which show good results in grasping the empirical data. Simple meets simple. Comple ...

2009

Measurement of printer MTFs

Albrecht Johannes Lindner

In this paper we compare three existing methods to measure the Modulation Transfer Function (MTF) of a printing system. Although all three methods use very distinct approaches, the MTF values computed for two of these methods strongly agree, lending credib ...

SPIE2009

Snakuscules

Michaël Unser, Philippe Thévenaz

A snakuscule (a minuscule snake) is the simplest active contour that we were able to design while keeping the quintessence of traditional snakes: an energy term governed by the data, and a regularization term. Our construction is an area-based snake, as op ...

IEEE2008

PID Controller Design with Specifications on the Infinity-Norm of Sensitivity Functions

Alireza Karimi, Roland Longchamp, Daniel Garcia

A controller design method using a frequency criterion is proposed in this paper. The frequency criterion is defined as the weighted sum of squared errors between the specified and computed values of the design parameters. These are the infinity-norm of th ...

2005

Expectation Propagation for Exponential Families

Matthias Seeger

This is a tutorial describing the Expectation Propagation (EP) algorithm for a general exponential family. Our focus is on simplicity of exposition. Although the overhead of translating a specific model into its exponential family representation can be con ...

2005

Processeur à haut degré de parallélisme basé sur des composantes sérielles

Ralph Hoffmann

Nowaday, the world of processors is still dominated by the RISC architectures, which foundations have been laid down in the 70's. The RISC concept may be summarized by one word : simplicity. With this concept, much simpler architectures are born, in partic ...

EPFL2004

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.