Pages that link to "Item:Q2930001"

The following pages link to Minimal Dirichlet Energy Partitions for Graphs (Q2930001):

Displaying 18 items.

• The method of fundamental solutions applied to boundary eigenvalue problems (Q289317) (← links)
• A minimal surface criterion for graph partitioning (Q338611) (← links)
• A novel partitioning method for block-structured adaptive meshes (Q1686600) (← links)
• An effective region force for some variational models for learning and clustering (Q1703055) (← links)
• A diffusion generated method for computing Dirichlet partitions (Q1715826) (← links)
• Diffusion generated methods for denoising target-valued images (Q2176514) (← links)
• A level set method for the Dirichlet \(k\)-partition problem (Q2221149) (← links)
• Efficient algorithm for optimizing spectral partitions (Q2335125) (← links)
• Optimal partition problems for the fractional Laplacian (Q2413458) (← links)
• A theory of spectral partitions of metric graphs (Q2663595) (← links)
• Uncertainty Quantification in Graph-Based Classification of High Dimensional Data (Q3176234) (← links)
• Consistency of Dirichlet Partitions (Q4592868) (← links)
• A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors (Q5037572) (← links)
• An Efficient Unconditionally Stable Method for Dirichlet Partitions in Arbitrary Domains (Q5095482) (← links)
• Extremal spectral gaps for periodic Schrödinger operators (Q5107944) (← links)
• An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs (Q6130647) (← links)
• An efficient and versatile variational method for high-dimensional data classification (Q6604513) (← links)
• The Potts model with different piecewise constant representations and fast algorithms: a survey (Q6606497) (← links)