More recent advances in (hyper) graph partitioning
In recent years, significant advances have been made in the design and evaluation of
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …
[图书][B] Recent advances in graph partitioning
Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
A new QoS prediction model using hybrid IOWA-ANFIS with fuzzy C-means, subtractive clustering and grid partitioning
Abstract Quality of Service (QoS) is one of the key indicators to measure the overall
performance of cloud services. The quantitative measurement of the QoS enables the …
performance of cloud services. The quantitative measurement of the QoS enables the …
A tutorial on spectral clustering
U Von Luxburg - Statistics and computing, 2007 - Springer
In recent years, spectral clustering has become one of the most popular modern clustering
algorithms. It is simple to implement, can be solved efficiently by standard linear algebra …
algorithms. It is simple to implement, can be solved efficiently by standard linear algebra …
Laplacian eigenmaps for dimensionality reduction and data representation
M Belkin, P Niyogi - Neural computation, 2003 - ieeexplore.ieee.org
One of the central problems in machine learning and pattern recognition is to develop
appropriate representations for complex data. We consider the problem of constructing a …
appropriate representations for complex data. We consider the problem of constructing a …
[PDF][PDF] A Multi-Level Algorithm For Partitioning Graphs.
B Hendrickson, RW Leland - SC, 1995 - researchgate.net
The graph partitioning problem is that of dividing the vertices of a graph into sets of speci ed
sizes such that few edges cross between sets. This NP {complete problem arises in many …
sizes such that few edges cross between sets. This NP {complete problem arises in many …
[图书][B] Object-oriented finite element programming: frameworks for analysis, algorithms and parallel computing
FT McKenna - 1997 - search.proquest.com
Object-oriented finite element programming: Frameworks for analysis, algorithms and
parallel computing Object-oriented finite element programming: Frameworks for analysis …
parallel computing Object-oriented finite element programming: Frameworks for analysis …
Domain decomposition algorithms
TF Chan, TP Mathew - Acta numerica, 1994 - cambridge.org
Domain decomposition refers to divide and conquer techniques for solving partial differential
equations by iteratively solving subproblems defined on smaller subdomains. The principal …
equations by iteratively solving subproblems defined on smaller subdomains. The principal …
Some applications of Laplace eigenvalues of graphs
B Mohar - Graph symmetry: Algebraic methods and applications, 1997 - Springer
In the last decade important relations between Laplace eigenvalues and eigenvectors of
graphs and several other graph parameters were discovered. In these notes we present …
graphs and several other graph parameters were discovered. In these notes we present …
Clustered ANFIS network using fuzzy c-means, subtractive clustering, and grid partitioning for hourly solar radiation forecasting
K Benmouiza, A Cheknane - Theoretical and Applied Climatology, 2019 - Springer
In this paper, an improved clustered adaptive neuro-fuzzy inference system (ANFIS) to
forecast an hour-ahead solar radiation data for 915 h is introduced. First, we have classified …
forecast an hour-ahead solar radiation data for 915 h is introduced. First, we have classified …