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.
The exact formalism from B. Zotter to compute beam coupling impedances has been fully developed only in the case of an infinitely long circular beam pipe. For other two dimensional geometries, some form factors are known only in the ultrarelativistic case ...
A multi-domain finite element formulation has been applied to determine the semi-solid permeability of an equiaxed granular structure. The granular model was constructed from a Voronoï tessellation algorithm. The liquid-solid interface is represented impli ...
In this paper our recent results in the capacity of single relay erasure channels are used to derive a new and tighter cut-set bound. We initially present a simple and intuitive approach to derive the classical cut-set bound in General Multi-Terminal Erasu ...
A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those offered by parallel DBMS. These techniques however, cannot guarantee high pe ...
In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM based algorithm to compute dense depth and occlusion maps from wide baseline image pairs using this descriptor. This yields much ...
Institute of Electrical and Electronics Engineers2010
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the ma ...
This paper introduces a subgradient descent algorithm to compute a Riemannian metric that minimizes an energy involving geodesic distances. The heart of the method is the Subgradient Marching Algorithm to compute the derivative of the geodesic distance wit ...
The effects of the subgrid scales on chemical transformations in large-eddy simulations of the convective atmospheric boundary layer (CBL) are investigated. Dynamic similarity subgrid-scale models are formulated and used to calculate the subgrid-scale cova ...
This paper presents an architecture for solving generically the problem of extracting the relevant features of a given task in a programming by demonstration framework and the problem of generalizing the acquired knowledge to various contexts. We validate ...
In this paper we propose an approach to count the number of pedestrians, given a trajectory data set provided by a tracking system. The tracking process itself is treated as a black box providing us the input data. The idea is to apply a hierarchical clust ...
