• Aucun résultat trouvé

[PDF] Top 20 A new result, for the box dimension of the graph of the Weierstrass function

Has 10000 "A new result, for the box dimension of the graph of the Weierstrass function" found on our website. Below are the top 20 most common "A new result, for the box dimension of the graph of the Weierstrass function".

A new result, for the box dimension of the graph of the Weierstrass function

A new result, for the box dimension of the graph of the Weierstrass function

... After the works of ...highlighted the fractal properties of the graph of the Weierstrass ...that the Hausdorff dimension of the ... Voir le document complet

11

Resistance metric, and spectral asymptotics, on the graph of the Weierstrass function

Resistance metric, and spectral asymptotics, on the graph of the Weierstrass function

... Keller. A simpler proof for the dimension of the graph of the classical Weierstrass ...Kigami. A harmonic calculus on the Sierpiński ... Voir le document complet

28

Box-covering algorithm for fractal dimension of complex networks

Box-covering algorithm for fractal dimension of complex networks

... INTRODUCTION The topological and dynamical aspects of complex net- works have been the focus of intensive research in recent years [ 1 – 15 ...is the question of how to cover ... Voir le document complet

6

Sequential dimension reduction for learning features of expensive black-box functions

Sequential dimension reduction for learning features of expensive black-box functions

... for learning features of expensive black-box functions ∗ Malek Ben Salem † , Fran¸ cois Bachoc ‡ , Olivier Roustant § , Fabrice Gamboa ‡ , and Lionel Tomaso ¶ ...Learning a feature of ... Voir le document complet

25

A New Objective Function For Hybrid Network In The Smart Grid

A New Objective Function For Hybrid Network In The Smart Grid

... evaluate the performance of the Parent Oriented solution, we have created a smart grid scenario that consists of a simple data collecting ...developed a new frame- ... Voir le document complet

4

The Graph Motif problem parameterized by the structure of the input graph

The Graph Motif problem parameterized by the structure of the input graph

... diagram of the relationship between different parameters ...by a line if the parameter below can be polynomially upper-bounded in the parameter ...above. For example, vertex ... Voir le document complet

24

The Graph Motif Problem Parameterized by the Structure of the Input Graph

The Graph Motif Problem Parameterized by the Structure of the Input Graph

... algorithm for the parameter distance to co-cluster which nicely reuses the FPT algorithms for both vertex cover number and distance to clique and another algorithm for parameter vertex ... Voir le document complet

12

A Γ-Convergence Result for the Upper Bound Limit Analysis of Plates

A Γ-Convergence Result for the Upper Bound Limit Analysis of Plates

... directly the ultimate load of structures without performing a cumbersome incremental ...paper a mathematical analysis which ensures the convergence of the finite element ... Voir le document complet

21

A fluctuation result for the displacement in the optimal matching problem

A fluctuation result for the displacement in the optimal matching problem

... and of fundamentally different nature. We refer to [16] for preliminary results in this ...also for d > 3. However, central to our proof are the deterministic quantitative estimates from ... Voir le document complet

39

A relaxation result for state constrained inclusions in infinite dimension

A relaxation result for state constrained inclusions in infinite dimension

... study a class of infinite dimensional differential inclusions subject to state ...kind of equations arises in several contexts. Differential inclusions find a natural application in a ... Voir le document complet

17

Learning a graph made of boolean function nodes : a new approach in machine learning

Learning a graph made of boolean function nodes : a new approach in machine learning

... be of a good use because it helps to solve the problem while maintaining the privacy of their ...In the context of third trusted party cryptography, there are several ... Voir le document complet

67

The Cournot outcome as the result of price competition

The Cournot outcome as the result of price competition

... paper of 1983, Kreps and Scheinkman state that the difference between Cournot and Bertrand competition is more than just the strategy space, but that timing of decisions is also rel- ...solve ... Voir le document complet

16

A Uniqueness Result for Minimizers of the 1D Log-gas Renormalized Energy

A Uniqueness Result for Minimizers of the 1D Log-gas Renormalized Energy

... configurations of density one, however this minimizer is not unique: in particular it was observed that local defects in the lattice, by the mean of arbitrary perturbations of Z on ... Voir le document complet

26

The Big Box Bill of Rights

The Big Box Bill of Rights

... It re-imagines the space surrounding Wal-mart big boxes as a legally public landscape; one that introduces an expanded right-of-way in an attempt to strike a more productive balanc[r] ... Voir le document complet

129

On the limiting distribution of the metric dimension for random forests

On the limiting distribution of the metric dimension for random forests

... Comparison of the two models. The plot of the constant term C given by (1) as a function of c is shown in Figure ...that the constant term in the ... Voir le document complet

23

Joint Learning of the Graph and the Data Representation for Graph-Based Semi-Supervised Learning

Joint Learning of the Graph and the Data Representation for Graph-Based Semi-Supervised Learning

... bottleneck for the development of accurate Natural Language Processing (NLP) tools for many applications and languages is the lack of annotated ...data. A natural remedy ... Voir le document complet

12

A unified framework for the comprehension of software's time dimension

A unified framework for the comprehension of software's time dimension

... comprehension. The identification of execution phases and evolution phases is difficult because of the amount of data to be ...understanding a program from its execution traces ... Voir le document complet

126

A rigidity result for global Mumford-Shah minimizers in dimension three

A rigidity result for global Mumford-Shah minimizers in dimension three

... in a half-plane, which contains a point of K on its ...be the whole half-plane. The major obstacle which prevents us to prove the full conjecture will be explain a ... Voir le document complet

25

On the most imbalanced orientation of a graph

On the most imbalanced orientation of a graph

... the graphs that have strong orientations are exactly the 2-edge-connected graphs [21] and later (1985), Chung et ...provided a linear time algorithm for checking whether a graph ... Voir le document complet

33

On the most imbalanced orientation of a graph

On the most imbalanced orientation of a graph

... . Graph orientation is a well studied area in graph theory and combinatorial optimization and thus a large variety of constrained orientations as well as objective functions have been ... Voir le document complet

15

Show all 10000 documents...