Publication

Hierarchical diffusion algorithms for distributed estimation

Publications associées (103)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Full range of blow up exponents for the quintic wave equation in three dimensions

Joachim Krieger

For the critical focusing wave equation

\square u=u^5

\mathbb{R}^{3+1}

in the radial case, we prove the existence of type II blow up solutions with scaling parameter

\lambda(t)=t^{-1\nu}

for all

\nu>0

. This extends the previous work by the autho ...

Elsevier2012

Transaction Polymorphism

Rachid Guerraoui, Vincent Gramoli

Concurrent implementations of abstract types usually rely on lock-free primitives or locks and are highly tuned to support a finite set of efficient operations. However, it is very hard to extend such types for specific needs by adding new operations. The ...

2011

Code Completion using Quantitative Type Inhabitation

Viktor Kuncak, Tihomir Gvero, Ruzica Piskac

Developing modern software applications typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that ...

2011

A Parameter Estimation Method for Fuel Cell Diagnostics

Jan Van Herle, Stefan Diethelm, Arata Nakajo, Leonidas Tsikonis

Researchers and developers typically use I-V curves (current vs. potential) as a means to demonstrate good data fitting of a model under experimental validation. Despite the popularity of this method, assessment of the results can be intuitive rather than ...

2011

Greedy Scheduling for Distributed Computing Clusters

Amin Karbasi, Milan Vojnovic

Allocating tasks to machines in computing clusters is described. In an embodiment a set of tasks associated with a job are received at a scheduler. In an embodiment an index can be computed for each combination of tasks and processors and stored in a looku ...

2011

Efficiently Maintaining Distributed Model-Based Views on Real-Time Data Streams

Karl Aberer, Sebastian Michel, Ho Young Jeung, Petre Alexandru Arion

Minimizing communication cost is a fundamental problem in large-scale federated sensor networks. Existing solutions applicable for the problem are often ad-hoc for specific query types, or they are inefficient when query results contain large volumes of da ...

2011

Improving API Documentation for Java-like Languages

Gilles Dubochet, Donna Malayeri

The Javadoc paradigm for displaying API documentation to users is quite popular, with similar variants existing for many mainstream languages. However, two user interface design properties of Javadoc may reduce its utility when displaying documentation for ...

2010

Generalized Monotonicity Analysis

Thomas Alois Weber

Complex economic models often lack the structure for the application of standard techniques in monotone comparative statics. Generalized monotonicity analysis (GMA) extends the available methods in several directions. First, it provides a way of finding pa ...

Springer Verlag2010

A self-organized, fault-tolerant and scalable replication scheme for cloud storage

Karl Aberer, Nicolas Bonvin

Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while different availability levels per application or per data item may be required. In t ...

ACM2010

Network Formulations of Mixed-Integer Programs

Friedrich Eisenbrand, Marco Di Summa

We consider mixed-integer sets described by system of linear inequalities in which the constraint matrix A is totally unimodular; the right-hand side is arbitrary vector; and a subset of the variables is required to be integer. We show that the problem of ...

INFORMS2009

Full range of blow up exponents for the quintic wave equation in three dimensions

Joachim Krieger

For the critical focusing wave equation

\square u=u^5

\mathbb{R}^{3+1}

in the radial case, we prove the existence of type II blow up solutions with scaling parameter

\lambda(t)=t^{-1\nu}

for all

\nu>0

. This extends the previous work by the autho ...

Elsevier2012