-
High-Resolution Spectroscopy and Structure of Osmium Tetroxide. A Benchmark S...
International audience -
Semantic structuring of verbal lexicon in Polish and French as a foreign lang...
Our study deals with two elements involved in the acquisition of Polish as a first language and of French as a foreign language.The first element is verbal... -
Preemptive and Non-Preemptive Generalized Min Sum Set Cover
International audience -
Log-supermodular functions, functional clones and counting CSPs
International audience -
Can we trust in numerical computations of chaotic solutions of dynamical syst...
From Laser Dynamics to Topology of Chaos, (celebrating the 70th birthday of Prof Robert Gilmore, Rouen, June 28-30, 2011), Ed. Ch. Letellier. -
Scheduling in the Presence of Processor Networks: Complexity and Approximation
International audience -
Approximativement. Le régime poétique de la véridiction
National audience -
Approximations of functionals of some modulated-Poisson Voronoi tessellations...
We consider the Voronoi tessellation of Euclidian plane that is generated by an inhomogeneous Poisson point process whose intensity takes different constant values on... -
Approximating Rooted Steiner Network
International audience -
La valeur de la connaissance approchée. L'épistémologie de l'approximation d'...
International audience -
The k-Sparsest Subgraph Problem
Given a simple undirected graph G = (V, E) and an integer k ≤ |V|, the k-sparsest subgraph problem asks for a set of k vertices that induce the minimum number of... -
Risk mapping based on hidden Markov random field and variational approximations
International audience -
Energy estimates for low regularity bilinear Schrödinger equations
International audience -
Efficient Robust Digital Hyperplane Fitting with Bounded Error
International audience -
Communications and scheduling
Cette HDR concerne l'ordonnancement en présence de divers communications -
Exact and approximate algorithms for computing the hyperbolicity of large-sca...
Let G be a connected graph, and let d(a, b) denotes the shortest path distance between vertices a and b of G. The graph G is δ-hyperbolic if for any vertices a, b, c,... -
Pour une analyse pragma-énonciative des figures de l'à-peu-près
Avant d'être considéré comme une figure, l'à-peu-près est un terme qui indique une mesure approximative, puis un jugement axiologique largement dépréciatif sur des... -
I3D Presentation of TVCG Paper Rational BRDF
International audience -
Taking Perturbation to the Accuracy Frontier: A Hybrid of Local and Global So...
International audience
