K-Adaptability in Two-Stage Distributionally Robust Binary Programming
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.
We propose an approach to incorporating dynamic models into the human body tracking process that yields full 3--D reconstructions from monocular sequences. We formulate the tracking problem is terms of minimizing a differentiable criterion whose differenti ...
We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths hi and degrees ni. We apply our results to derive spline-convolution-based algorithms for two closely related prob ...
We present an algorithm for nonlinear multidimensional registration. The correspondence function is represented in a spline space, as well as the volumes being registered. We also use the cubic splines to interpolate the volumetric data to be registered. W ...
The purpose of this paper is to develop methods that can reconstruct a bandlimited discrete-time signal from an irreg- ular set of samples at unknown locations. We define a solution to the problem using first a geometric and then an algebraic point of view ...
While the largest common subgraph (LCSG) between a query and a database of models can provide an elegant and intuitive measure of similarity for many applications, it is computationally expensive to compute. Recently developed algorithms for subgraph isomo ...
While the largest common subgraph (LCSG) between a query and a database of models can provide an elegant and intuitive measure of similarity for many applications, it is computationally expensive to compute. Recently developed algorithms for subgraph isomo ...
For the analysis of flows in compliant vessels, we propose an approach to couple the original 3D equations with a convenient 1D model. This multi-scale strategy allows for a dramatic reduction of the computational complexity and is suitable for "absorbing" ...
An HMM-based speaker clustering framework is presented, where the number of speakers and segmentation boundaries are unknown \emph{a priori}. Ideally, the system aims to create one pure cluster for each speaker. The HMM is ergodic in nature with a minimum ...
An HMM-based speaker clustering framework is presented, where the number of speakers and segmentation boundaries are unknown \emph{a priori}. Ideally, the system aims to create one pure cluster for each speaker. The HMM is ergodic in nature with a minimum ...
We present a statistical view of the texture retrieval problem by combining the two related tasks, namely feature extraction (FE) and similarity measurement (SM), into a joint modeling and classification scheme. We show that using a con- sistent estimator ...
