
A Generalized Asymmetric Dualfront Model for Active Contours and Image Segmentation
The geodesic distancebased dualfront curve evolution model is a powerf...
read it

Trajectory Grouping with Curvature Regularization for Tubular Structure Tracking
Tubular structure tracking is an important and difficult problem in the ...
read it

Minimal Paths for Tubular Structure Segmentation with Coherence Penalty and Adaptive Anisotropy
The minimal path method has proven to be particularly useful and efficie...
read it

The shortest way to visit all metro lines in Paris
What if {a tourist, a train addict, Dr. Sheldon Cooper, somebody who lik...
read it

A New CoherencePenalized Minimal Path Model with Application to Retinal Vessel Centerline Delineation
In this paper, we propose a new minimal path model for minimally interac...
read it

Using Posters to Recommend Anime and Mangas in a ColdStart Scenario
Item coldstart is a classical issue in recommender systems that affects...
read it

GAN and VAE from an Optimal Transport Point of View
This short article revisits some of the ideas introduced in arXiv:1701.0...
read it

Learning opening books in partially observable games: using random seeds in Phantom Go
Many artificial intelligences (AIs) are randomized. One can be lucky or ...
read it

Modelling dependency completion in sentence comprehension as a Bayesian hierarchical mixture process: A case study involving Chinese relative clauses
We present a casestudy demonstrating the usefulness of Bayesian hierarc...
read it

Relaxationbased revision operators in description logics
As ontologies and description logics (DLs) reach out to a broader audien...
read it

TripleSpin  a generic compact paradigm for fast machine learning computations
We present a generic compact computational framework relying on structur...
read it

Global Minimum for a Finsler Elastica Minimal Path Approach
In this paper, we propose a novel curvaturepenalized minimal path model...
read it

Multidimensional signal approximation with sparse structured priors using split Bregman iterations
This paper addresses the structurallyconstrained sparse decomposition o...
read it

New Results on Equilibria in Strategic Candidacy
We consider a voting setting where candidates have preferences about the...
read it

Image Labeling by Assignment
We introduce a novel geometric approach to the image labeling problem. A...
read it

Minimal Proof Search for Modal Logic K Model Checking
Most modal logics such as S5, LTL, or ATL are extensions of Modal Logic ...
read it

Fourier descriptors based on the structure of the human primary visual cortex with applications to object recognition
In this paper we propose a supervised object recognition method using ne...
read it

Total Variation Minimization and Graph Cuts for Moving Objects Segmentation
In this paper, we are interested in the application to video segmentatio...
read it

Statistical estimation in a randomly structured branching population
We consider a binary branching process structured by a stochastic trait ...
read it

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
A (unit) disk graph is the intersection graph of closed (unit) disks in ...
read it

Optimality Program in Segment and String Graphs
Planar graphs are known to allow subexponential algorithms running in ti...
read it

Orthogonal Terrain Guarding is NPcomplete
A terrain is an xmonotone polygonal curve, i.e., successive vertices ha...
read it

Nonparametric estimation of the fragmentation kernel based on a PDE stationary distribution approximation
We consider a stochastic individualbased model in continuous time to de...
read it

Early stopping for statistical inverse problems via truncated SVD estimation
We consider truncated SVD (or spectral cutoff, projection) estimators f...
read it

Fast Asymmetric Fronts Propagation for Image Segmentation
In this paper, we introduce a generalized asymmetric fronts propagation ...
read it

Structurally Parameterized dScattered Set
In dScattered Set we are given an (edgeweighted) graph and are asked t...
read it

Parameterized (Approximate) Defective Coloring
In Defective Coloring we are given a graph G = (V, E) and two integers χ...
read it

A formal framework for deliberated judgment
While the philosophical literature has extensively studied how decisions...
read it

Morphologic for knowledge dynamics: revision, fusion, abduction
Several tasks in artificial intelligence require to be able to find mode...
read it

Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction
The aim of this paper is to introduce a new framework for defining abduc...
read it

EPTAS for Max Clique on Disks and Unit Balls
We propose a polynomialtime algorithm which takes as input a finite set...
read it

Estimating fast meanreverting jumps in electricity market models
Based on empirical evidence of fast meanreverting spikes, we model elec...
read it

Computing and Testing Pareto Optimal Committees
Selecting a set of alternatives based on the preferences of agents is an...
read it

How Bad is the Freedom to FloodIt?
FixedFloodIt and FreeFloodIt are combinatorial problems on graphs th...
read it

Covering with Clubs: Complexity and Approximability
Finding cohesive subgraphs in a network is a wellknown problem in graph...
read it

The Coordinate Sampler: A NonReversible Gibbslike MCMC Sampler
In this article, we derive a novel nonreversible, continuoustime Marko...
read it

Calibration procedures for approximate Bayesian credible sets
We develop and apply two calibration procedures for checking the coverag...
read it

A Selfadaptive Agentbased System for Cloud Platforms
Cloud computing is a model for enabling ondemand network access to a sh...
read it

Maximum Independent Sets in Subcubic Graphs: New Results
The maximum independent set problem is known to be NPhard in the class ...
read it

Weighted Upper Edge Cover: Complexity and Approximability
Optimization problems consist of either maximizing or minimizing an obje...
read it

Efficient volatility estimation in a twofactor model
We statistically analyse a multivariate HJM diffusion model with stochas...
read it

A new approach to learning in Dynamic Bayesian Networks (DBNs)
In this paper, we revisit the parameter learning problem, namely the est...
read it

A discrete version of CMAES
Modern machine learning uses more and more advanced optimization techniq...
read it

Averagecase complexity of a branchandbound algorithm for min dominating set
The averagecase complexity of a branchandbound algorithms for Minimum...
read it

Nonparametric adaptive inference of birth and death models in a large population limit
Motivated by improving mortality tables from human demography databases,...
read it

Computer code validation via mixture model estimation
When computer codes are used for modeling complex physical systems, thei...
read it

Proportionally dense subgraph of maximum size: complexity and approximation
We define a proportionally dense subgraph (PDS) as an induced subgraph o...
read it

Variable selection and estimation in multivariate functional linear regression via the lasso
In more and more applications, a quantity of interest may depend on seve...
read it

Independent Set Reconfiguration Parameterized by ModularWidth
Independent Set Reconfiguration is one of the most wellstudied problems...
read it

A unified view on differential privacy and robustness to adversarial examples
This short note highlights some links between two lines of research with...
read it
Université ParisDauphine
Place du Maréchal de Lattre de Tassigny  75775 PARIS Cedex 16  Tel.: 01 44 05 44 05  Fax: 01 44 05 49