Bipartite Spectral Graph Partitioning to Co-Cluster Varieties and Sound Correspondences in Dialectology

doi 10.3115/1708124.1708129
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Segmentation Using Superpixels: A Bipartite Graph Partitioning Approach

2012English

A Subspace Semidefinite Programming for Spectral Graph Partitioning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

The Bipartite-Splittance of a Bipartite Graph

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Supervised Learning of Large Perceptual Organization: Graph Spectral Partitioning and Learning Automata

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
2000English

Using Mnemonic Strategies to Teach Letter-Name and Letter-Sound Correspondences

2011English

Bipartite Graph Bundles With Connected Fibres

Bulletin of the Australian Mathematical Society
Mathematics
1999English

Bipartite Tight Spectral Clustering (BiTSC) Algorithm for Identifying Conserved Gene Co-Clusters in Two Species

2019English

Brain Sensitivity to Print Emerges When Children Learn Letter–speech Sound Correspondences

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2010English

Watermarking Graph Partitioning Solutions

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy