Concept

Linear differential equation

Related publications (416)

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.

Efficient Implementation of Linear Programming Decoding

Mohammad Amin Shokrollahi

While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message-passing (IMP) decoding, it is computationally more complex to implement in its original form, due to both the large size of the r ...

2011

Incremental model identification for homogeneous systems – A comparison

Dominique Bonvin, Michael Amrhein, Nirav Pravinbhai Bhatt

The identification of reaction kinetics involves the determination of a model structure (reaction stoichiometry, rate laws for all reactions) and its corresponding parameters from experimental data. An incremental identification approach for determining th ...

2011

NineML: the network interchange for neuroscience modeling language

Sean Lewis Hill, Eilif Benjamin Muller, Michael Lee Hines

The growing number of large-scale neuronal network models has created a need for standards and guidelines to ease model sharing and facilitate the replication of results across different simulators. To foster community efforts towards such standards, the I ...

2011

New Impossible Differential and Known-Key Distinguishers for the 3D Cipher

Jorge Nakahara

The contributions of this paper are new 6-round impossible-differential (ID) and 9.75-round known-key distinguishers for the 3D block cipher. The former was constructed using the miss-in-the-middle technique, while the latter with an inside-out technique. ...

Springer-Verlag Berlin2011

Approximability of Sparse Integer Programs

David Pritchard

The main focus of this paper is a pair of new approximation algorithms for certain integer programs. First, for covering integer programs {min cx:Ax≥b,0≤x≤d} where A has at most k nonzeroes per row, we give a k-approximation algorithm. (We assume A,b,c,d a ...

Springer-Verlag2011

Recursive analysis of singular ordinary differential equations

We investigate systems of ordinary differential equations with a parameter. We show that under suitable assumptions on the systems the solutions are computable in the sense of recursive analysis. As an application we give a complete characterization of the ...

Elsevier2010

Cryptanalysis of reduced-round MIBS Block cipher

Serge Vaudenay, Jorge Nakahara, Asli Bay

This paper presents the first independent and systematic lin- ear, differential and impossible-differential (ID) cryptanalyses of MIBS, a lightweight block cipher aimed at constrained devices such as RFID tags and sensor networks. Our contributions include ...

Springer2010

Bound states of the Schrodinger-Newton model in low dimensions

Joachim Stubbe, Marc Vuffray

We prove the existence of quasi-stationary symmetric solutions with exactly n >= 0 zeros and uniqueness for n = 0 for the Schrodinger-Newton model in one dimension and in two dimensions along with an angular momentum m >= 0. Our result is based on an analy ...

2010

Certified Reduced Basis Methods and Output Bounds for the Harmonic Maxwell's Equations

Jan Sickmann Hesthaven, Yvon Maday

We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the harmonic Maxwell's equations. The truth approximation and the development of th ...

SIAM PUBLICATIONS2010

On the Age of Pseudonyms in Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Julien Freudiger

In many envisioned mobile ad hoc networks, nodes are expected to periodically beacon to advertise their presence. In this way, they can receive messages addressed to them or participate in routing operations. Yet, these beacons leak information about the n ...

2010