[PDF] Top 20 The geodesic classification problem on graphs
Has 10000 "The geodesic classification problem on graphs" found on our website. Below are the top 20 most common "The geodesic classification problem on graphs".
The geodesic classification problem on graphs
... Definimos e estudamos uma versão discreta do clássico problema de classificação no espaço Euclidiano. O problema em questão é definido em um grafo, onde os vértices não classificados precisam ser classificados levando em ... See full document
150
Publicações do PESC On The Helly Property of Some Intersection Graphs
... focus on variations of the EPT representations, such as [18] and ...represent the same research divided into two ...define the graph ENPT(P ) of edge intersecting non- splitting paths of a ... See full document
103
Concept Location based on System Dependency Graphs
... extract the structural information from source code like the System Dependence ...how the program executes, which methods are called, who called certain method, the order they are called and ... See full document
72
Using Interval Graphs in an Order Processing Optimization Problem
... research on the MOSP demonstrates that any instance of the problem can be put in a graph with a vertex for each client [9] and a solution can be obtained by traversing the arcs of that ... See full document
7
Open Capillary Problem and Mean Curvature Flow of Killing Graphs
... depending on the curvature and the derivative of the curvature in the ambient ...manifold. The analogous result for the one dimensional case, the curve shortening ... See full document
74
Bounds on volume growth of geodesic balls For einstein warped products
... understand the geometry of Ein- stein manifolds as well as Einstein-type manifolds, for instance, Ricci solitons and m-quasi-Einstein ...fruitful problem in Riemannian Geom- etry. Ricci solitons model ... See full document
8
PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION
... After the success of GNSS (Global Navigational Satellite Systems) and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – ... See full document
8
On the treewidths of graphs of bounded degree.
... based on a tree decomposition of treewidth k for G ...optimization problem that can be formulated with Monadic Sec- ond Order (MSO) logic can be solved in polynomial time when a tree decomposition of bound- ... See full document
9
Data-driven catchment classification: application to the PUB problem
... ments. The gap in terms of performance between regional models based on SOMY and models based on all alternative classifications is ...with the limitations of the simplistic regional ... See full document
37
SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
... the problem of computing the shortest paths tree when new costs are given to a subset K of the arcs of G, either lower or higher than the old ...ones. The reoptimization ... See full document
22
eve cccavalcante geodesic
... of the principal draw- backs concerns the high dimensional and non-linearly nature of the underlying ...poor on-line deci- sions due to computational ...of the data. To cite a few, we ... See full document
3
On the Adjacent Eccentric Distance Sum Index of Graphs.
... basic problem in structure-activity relation- ships (SAR) which is an important tool for developing safer and potent ...drugs. The procedure for quantification of chemical structures is by translation of ... See full document
12
A preliminary approach to the multilabel classification problem of Portuguese juridical documents
... 6. Paulo Quaresma and Irene Pimenta Rodrigues. PGR: Portuguese attorney gen- eral’s office decisions on the web. In Bartenstein, Geske, Hannebauer, and Yoshie, editors, Web-Knowledge Management and Decision ... See full document
10
Statistical inference on random graphs and networks
... for the reader’s convenience. Part I covers the model selection problem for the ...present the definitions and notations of random graphs used in this ...of the ... See full document
97
A decomposition approach for the p-median problem on disconnected graphs
... with the subproblem elimination algorithm RAS before enter- ing the do while cycle of algorithm DecU&U, have a theoretical ...When the decrease of marginal costs is monotone (i.e., the ... See full document
15
Hat problem on graphs with exactly three cycles
... hat problem on a graph was considered by Krzywkowski [6]. The players are placed on the vertices of a graph, and a player can only see the colors of hats of his ...neighbors. ... See full document
12
Data-driven catchment classification: application to the pub problem
... CCA, on the available set of catchment descriptors before apply- ing SOM; (iii) catchment classification provides a great deal of information for enhancing hydrological predictions in un- gauged ... See full document
15
Upper bounds on the Laplacian energy of some graphs
... use the fact that, the arithmetic mean of two non- negative real numbers is greater than or equal to the geometric mean of ...By the previous fact considering the nonnegative numbers qg ... See full document
12
A note on arbitrarily vertex decomposable graphs
... Observe that any necessary condition for a graph to contain a perfect matching (or a matching that omits exactly one vertex) is a necessary condition for a graph to be arbitrarily vertex decomposable. Thus we will assume ... See full document
10
The solution of problem of objects classification as the method of restoration of objects images
... [r] ... See full document
11
temas relacionados