-
Hamilton-Jacobi equations constrained on networks
The previous versions of this preprint had the different title Hamilton-Jacobi equation on networks. The link for these old versions is hal-00503910 - version 4 -
Web Graphs, PageRank-like Measurements
The purpose of this thesis is to apply PageRank-like measures to Web graphs. The first part introduces the Web graphs. First we define the notion of indexable Web,... -
Context-aware annotation and retrieval of socio-personal multimedia documents
The overall objective of this thesis is to exploit a user centric means of representation, acquisition, enrichment and exploitation of multimedia document metadata. To... -
Behavior graphs for hybrid systems monitoring
International audience -
Walk on City Maps - Mathematical and Physical phenomenology of the City, a Ge...
We are interested in the phenomenology of cities by restricting them to the geometry of their street network. This study aims at being synthetic, functional and... -
Perturbation of eigenvalues of matrix pencils and optimal assignment problem
We consider a matrix pencil whose coefficients depend on a positive parameter epsilon, and have asymptotic equivalents of the form aepsilon^A when epsilon goes to... -
Asymptotic study of subcritical graph classes
International audience -
Generic Asymptotics of Eigenvalues and Min-Plus Algebra
We consider a square matrix $\mathcal{A}_{\epsilon}$ whose entries have asymptotics of the form $(\mathcal{A}_{\epsilon})_{ij}=... -
Morphological filtering on graphs
International audience -
The InfoVis Toolkit
This report presents the InfoVis Toolkit, designed to support the creation, extension and integration of advanced 2D Information Visualization components into... -
Linked Task Scheduling : Algorithms for the Single Machine Case
We consider a system made of one resource. The execution of the tasks is non-preemptive on this resource. The tasks we consider are composed of a given number of... -
Computing shortest, fastest, and foremost journeys in dynamic networks
New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior.... -
Directed Virtual Path Layouts in ATM Networks
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical... -
Mean analysis of an online algorithm for the vertex cover problem
International audience -
Optimal Wavelength-Routed Multicasting
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of... -
Graph Problems Arising from Wavelength-Routing in All-Optical Networks
We survey the theoretical results obtained for wavelength routing in all--optical networks, present some new results and propose several open problems. In all--optical... -
A region-level graph labeling approach to motion-based segmentation
This paper deals with the problem of motion-based segmentation of image sequences. Such partitions are multiple-purpose in dynamic scene analysis We first extract a... -
A Meyers type regularity result for approximations of second order elliptic o...
International audience -
Disjoint unions of complete graphs characterized by their Laplacian spectrum
International audience -
Simplicial simple-homotopy of flag complexes in terms of graphs
International audience
