Institution
Paris Dauphine University
Education•Paris, France•
About: Paris Dauphine University is a education organization based out in Paris, France. It is known for research contribution in the topics: Context (language use) & Population. The organization has 1766 authors who have published 6909 publications receiving 162747 citations. The organization is also known as: Paris Dauphine & Dauphine.
Topics: Context (language use), Population, Approximation algorithm, Bounded function, Nonlinear system
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, a probabilistic and statistical comparison of the log-GARCH and EGARCH models is presented, which both rely on multiplicative volatility dynamics without positivity constraints.
43 citations
••
01 Oct 2009TL;DR: A novel 4D iterative key point searching scheme is applied, in which the minimal action map and the Euclidean length map are calculated with a 4D freezing fast marching evolution, and a natural notion of a multi-branch tube's "central curve" is taken by taking only the first three spatial coordinates of the detected 4D multi-Branch curve.
Abstract: An innovative 3D multi-branch tubular structure and centerline extraction method is proposed in this paper In contrast to classical minimal path techniques that can only detect a single curve between two pre-defined initial points, this method propagates outward from only one initial seed point to detect 3D multi-branch tubular surfaces and centerlines simultaneously First, instead of only representing the trajectory of a tubular structure as a 3D curve, the surface of the entire structure is represented as a 4D curve along which every point represents a 3D sphere inside the tubular structure Then, from any given sphere inside the tubular structure, a novel 4D iterative key point searching scheme is applied, in which the minimal action map and the Euclidean length map are calculated with a 4D freezing fast marching evolution A set of 4D key points is obtained during the front propagation process Finally, by sliding back from each key point to the previous one via the minimal action map until all the key points are visited, we are able to fully obtain global minimizing multi-branch tubular surfaces An additional immediate benefit of this method is a natural notion of a multi-branch tube's "central curve" by taking only the first three spatial coordinates of the detected 4D multi-branch curve Experimental results on 2D/3D medical vascular images illustrate the benefits of this method
43 citations
••
TL;DR: In this article, the authors derived rates of contraction of posterior distributions on non-parametric models resulting from sieve priors and applied them to density, regression, nonlinear autoregression and Gaussian white noise models.
Abstract: .
We derive rates of contraction of posterior distributions on non-parametric models resulting from sieve priors. The aim of the study was to provide general conditions to get posterior rates when the parameter space has a general structure, and rate adaptation when the parameter is, for example, a Sobolev class. The conditions employed, although standard in the literature, are combined in a different way. The results are applied to density, regression, nonlinear autoregression and Gaussian white noise models. In the latter we have also considered a loss function which is different from the usual l2 norm, namely the pointwise loss. In this case it is possible to prove that the adaptive Bayesian approach for the l2 loss is strongly suboptimal and we provide a lower bound on the rate.
43 citations
••
TL;DR: This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.
43 citations
•
TL;DR: This work estimates the intensity function of the Poisson regression model by using a dictionary approach, which generalizes the classical basis approach, combined with a Lasso or a group-Lasso procedure, and shows that the associated Lasso and group- Lasso procedures are theoretically optimal in the oracle approach.
Abstract: High dimensional Poisson regression has become a standard framework for the analysis of massive counts datasets. In this work we estimate the intensity function of the Poisson regression model by using a dictionary approach, which generalizes the classical basis approach, combined with a Lasso or a group-Lasso procedure. Selection depends on penalty weights that need to be calibrated. Standard methodologies developed in the Gaussian framework can not be directly applied to Poisson models due to heteroscedasticity. Here we provide data-driven weights for the Lasso and the group-Lasso derived from concentration inequalities adapted to the Poisson case. We show that the associated Lasso and group-Lasso procedures satisfy fast and slow oracle inequalities. Simulations are used to assess the empirical performance of our procedure, and an original application to the analysis of Next Generation Sequencing data is provided.
43 citations
Authors
Showing all 1819 results
Name | H-index | Papers | Citations |
---|---|---|---|
Pierre-Louis Lions | 98 | 283 | 57043 |
Laurent D. Cohen | 94 | 417 | 42709 |
Chris Bowler | 87 | 288 | 35399 |
Christian P. Robert | 75 | 535 | 36864 |
Albert Cohen | 71 | 368 | 19874 |
Gabriel Peyré | 65 | 303 | 16403 |
Kerrie Mengersen | 65 | 737 | 20058 |
Nader Masmoudi | 62 | 245 | 10507 |
Roland Glowinski | 61 | 393 | 20599 |
Jean-Michel Morel | 59 | 302 | 29134 |
Nizar Touzi | 57 | 224 | 11018 |
Jérôme Lang | 57 | 277 | 11332 |
William L. Megginson | 55 | 169 | 18087 |
Alain Bensoussan | 55 | 417 | 22704 |
Yves Meyer | 53 | 128 | 14604 |