• Aucun résultat trouvé

Weighted graphs

Nonlocal Discrete Regularization on Weighted Graphs: a framework for Image and Manifold Processing

Nonlocal Discrete Regularization on Weighted Graphs: a framework for Image and Manifold Processing

... on weighted graphs of the arbitrary topologies for image and manifold ...a weighted sum of two energy terms: a regularization one that uses a discrete weighted p-Dirichlet energy, and an ...

15

A short tour of mathematical morphology on edge and vertex weighted graphs

A short tour of mathematical morphology on edge and vertex weighted graphs

... edge-weighted graphs: they can be equivalently defined by a steepest descent property on the catchment basins (regions) or by the drop of water principle on the cut (border) which separate ...

33

Gradual Semantics for Weighted Graphs: An Unifying Approach

Gradual Semantics for Weighted Graphs: An Unifying Approach

... Abstract The paper bridges the gap between two general settings of gradual semantics for weighted argumentation graphs: the evaluation method setting (EMS) and the principle-based one (PBS). The former ...

6

Watersheds on edge or node weighted graphs

Watersheds on edge or node weighted graphs

... This leads to an approach where two scales are considered : for segmenting an image, the catchment basins of its gradient image are rst constructed at the pixel level ; the nal segmentation is then made at the level of ...

119

Improper colouring of weighted grid and hexagonal graphs

Improper colouring of weighted grid and hexagonal graphs

... of weighted graphs of a certain class with as few colours as ...each weighted graph (G, p) in this class with at most c 1 × χ k (G, p) + c 2 colours for some constants c 1 and c 2 , is said to be c 1 ...

16

Weighted Improper Colouring

Weighted Improper Colouring

... Note that when all weights are equal to one, we obtain the bound for the improper colouring derived in [12]. Brooks [5] proved that for a connected graph G, χ(G) = ∆(G)+1 if, and only if, G is complete or an odd cycle. ...

15

Weighted Coloring on P4-sparse Graphs

Weighted Coloring on P4-sparse Graphs

... for weighted graphs,” Information Processing Letters, ...“Perfect graphs,” ...Split Graphs: Complexity and Improved Approximation,” in Proceedings of the 15th ...

7

Improper colouring of weighted grid and hexagonal graphs

Improper colouring of weighted grid and hexagonal graphs

... of weighted graphs of a certain class with as few colours as ...each weighted graph (G, p) in this class with at most c 1 × χ k (G, p) + c 2 colours for some constants c 1 and c 2 , is said to be c 1 ...

20

Planar graphs as L-intersection or L-contact graphs

Planar graphs as L-intersection or L-contact graphs

... planar graphs as contact or intersection graphs, where the assigned shapes are segments or polylines in the ...of graphs by intersection of curves is the so-called string -representation: each vertex ...

23

Weighted Banzhaf power and interaction indexes through weighted approximations of games

Weighted Banzhaf power and interaction indexes through weighted approximations of games

... of smaller degree in the sense of standard (non-weighted and non- constrained) least squares. They showed that the Banzhaf power index appears as the coefficients of the linear terms in the solution of the ...

21

On Rational Graphs

On Rational Graphs

... Unité de recherche INRIA Lorraine, Technopôle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LÈS NANCY Unité de recherche INRIA Rennes, Irisa, [r] ...

24

Weighted improper colouring

Weighted improper colouring

... Motivated by the original application, we then study a special interference model on various grids (square, triangular, hexagonal) where a node produces a noise of intensity 1 for its neighbours and a noise of intensity ...

25

Metric Dimension: from Graphs to Oriented Graphs

Metric Dimension: from Graphs to Oriented Graphs

... undirected graphs The distance dist G (u, v) (or simply dist(u, v) when no ambiguity is possible) between two vertices u, v of an undirected graph G is the length of a shortest path from u to ...

22

Weighted Improper Colouring

Weighted Improper Colouring

... signals to areas on the ground called spots. These spots form a grid-like struc- ture which is modelled by an hexagonal cell graph. To each spot is assigned a radio channel or colour. Spots are interfering with other ...

61

Weighted LP estimates on Riemannian manifolds

Weighted LP estimates on Riemannian manifolds

... cisely, weighted inequalities. Our main interests are the weighted L p -bounds of the Riesz transforms on complete Riemannian manifolds and the sharpness of the bounds in terms of the power of the ...

170

Weighted uniform densities

Weighted uniform densities

... uniform weighted den- sity (upper and lower) of a subset A of N ∗ , with respect to a given sequence of weights (a n ...two weighted densities (having different sequences of weights) and a theorem of ...

15

Weighted modal transition systems

Weighted modal transition systems

... Our proposed quantitative specification framework uses weighted modal transi- tion systems as a formal model of specifications. These are labeled transition systems with the additional feature that they can model ...

30

Weighted U-frequent hypercyclicity

Weighted U-frequent hypercyclicity

... Difference sets and frequently hypercyclic weighted shifts.. Ergod.[r] ...

11

Epidemic spread on weighted networks

Epidemic spread on weighted networks

... One limitation to our approach is due to potential errors in the inference of the network. There are known biases in the self- reporting of number of partners (with different trends between men and women [37]) and ...

11

Weighted Coloring in Trees

Weighted Coloring in Trees

... then Weighted Coloring in trees is not in P. Related work. Weighted Coloring has been shown to be NP-hard in the classes of split graphs, interval graphs, triangle-free planar graphs ...

13

Show all 1117 documents...

Sujets connexes