{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-partitioning/papers/2","list_of":"/task/graph-partitioning","task":"graph partitioning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"of":208,"counts":{"archive_papers_tagged":208,"with_a_code_link":69,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":208,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-partitioning","prev":"/task/graph-partitioning","next":"/task/graph-partitioning/papers/3","papers":[{"url":null,"slug":"fast-algorithms-for-directed-graph","title":"Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues","date":"2023-06-15","arxiv_id":"2306.09128","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-step-bipartite-graph-cut-a-normalized","title":"One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering","date":"2023-05-12","arxiv_id":"2305.07386","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-compressed-sparse-row-format-for","title":"Distributed Compressed Sparse Row Format for Spiking Neural Network Simulation, Serialization, and Interoperability","date":"2023-04-12","arxiv_id":"2304.05587","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-and-skill-diverse-student-group","title":"Fair and skill-diverse student group formation via constrained k-way graph partitioning","date":"2023-01-12","arxiv_id":"2301.09984","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-graph-convolutional-network-training","title":"Scalable Graph Convolutional Network Training on Distributed-Memory Systems","date":"2022-12-09","arxiv_id":"2212.05009","repositories_listed":0,"syntology":null},{"url":null,"slug":"ago-boosting-mobile-ai-inference-performance","title":"AGO: Boosting Mobile AI Inference Performance by Removing Constraints on Graph Optimization","date":"2022-12-02","arxiv_id":"2212.01005","repositories_listed":0,"syntology":null},{"url":null,"slug":"sub-graph-learning-for-spatiotemporal","title":"Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation","date":"2022-11-17","arxiv_id":"2211.09740","repositories_listed":0,"syntology":null},{"url":null,"slug":"agglomeration-of-polygonal-grids-using-graph","title":"Agglomeration of Polygonal Grids using Graph Neural Networks with applications to Multigrid solvers","date":"2022-10-31","arxiv_id":"2210.17457","repositories_listed":0,"syntology":null},{"url":null,"slug":"nimble-gnn-embedding-with-tensor-train","title":"Nimble GNN Embedding with Tensor-Train Decomposition","date":"2022-06-21","arxiv_id":"2206.10581","repositories_listed":0,"syntology":null},{"url":null,"slug":"more-recent-advances-in-hyper-graph","title":"More Recent Advances in (Hyper)Graph Partitioning","date":"2022-05-26","arxiv_id":"2205.13202","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-approach-to-graph-partitioning","title":"A Bayesian Approach To Graph Partitioning","date":"2022-04-24","arxiv_id":"2204.12927","repositories_listed":0,"syntology":null},{"url":null,"slug":"wawpart-workload-aware-partitioning-of","title":"WawPart: Workload-Aware Partitioning of Knowledge Graphs","date":"2022-03-28","arxiv_id":"2203.14888","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-differentiable-approach-to-combinatorial","title":"A Differentiable Approach to Combinatorial Optimization using Dataless Neural Networks","date":"2022-03-15","arxiv_id":"2203.08209","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-spectral-clustering-for-directed","title":"Generalized Spectral Clustering for Directed and Undirected Graphs","date":"2022-03-07","arxiv_id":"2203.03221","repositories_listed":0,"syntology":null},{"url":null,"slug":"sugar-efficient-subgraph-level-training-via","title":"SUGAR: Efficient Subgraph-level Training via Resource-aware Graph Partitioning","date":"2022-01-31","arxiv_id":"2202.00075","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-and-spectral-embedding-for","title":"Deep Learning and Spectral Embedding for Graph Partitioning","date":"2021-10-16","arxiv_id":"2110.08614","repositories_listed":0,"syntology":null},{"url":null,"slug":"trading-quality-for-efficiency-of-graph","title":"Trading Quality for Efficiency of Graph Partitioning: An Inductive Method across Graphs","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-design-flow-for-mapping-spiking-neural","title":"A Design Flow for Mapping Spiking Neural Networks to Many-Core Neuromorphic Hardware","date":"2021-08-27","arxiv_id":"2108.12444","repositories_listed":0,"syntology":null},{"url":null,"slug":"stateless-actor-critic-for-instance","title":"Stateless actor-critic for instance segmentation with high-level priors","date":"2021-07-06","arxiv_id":"2107.02600","repositories_listed":0,"syntology":null},{"url":null,"slug":"xer-an-explainable-model-for-entity","title":"xER: An Explainable Model for Entity Resolution using an Efficient Solution for the Clique Partitioning Problem","date":"2021-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ell-2-norm-flow-diffusion-in-near-linear-time","title":"$\\ell_2$-norm Flow Diffusion in Near-Linear Time","date":"2021-05-30","arxiv_id":"2105.14629","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnnie-gnn-inference-engine-with-load","title":"GNNIE: GNN Inference Engine with Load-balancing and Graph-Specific Caching","date":"2021-05-21","arxiv_id":"2105.10554","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-for-instance","title":"Reinforcement learning for instance segmentation with high-level priors","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-inconsistent","title":"Graph Neural Networks for Inconsistent Cluster Detection in Incremental Entity Resolution","date":"2021-05-12","arxiv_id":"2105.05957","repositories_listed":0,"syntology":null},{"url":null,"slug":"distgnn-scalable-distributed-training-for","title":"DistGNN: Scalable Distributed Training for Large-Scale Graph Neural Networks","date":"2021-04-14","arxiv_id":"2104.06700","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-graph-partitioning-for-very-large","title":"Automatic Graph Partitioning for Very Large-scale Deep Learning","date":"2021-03-30","arxiv_id":"2103.16063","repositories_listed":0,"syntology":null},{"url":null,"slug":"endurance-aware-mapping-of-spiking-neural","title":"Endurance-Aware Mapping of Spiking Neural Networks to Neuromorphic Hardware","date":"2021-03-09","arxiv_id":"2103.05707","repositories_listed":0,"syntology":null},{"url":null,"slug":"rank-ai-assisted-end-to-end-architecture-for","title":"RANK: AI-assisted End-to-End Architecture for Detecting Persistent Attacks in Enterprise Networks","date":"2021-01-06","arxiv_id":"2101.02573","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-training-of-graph-convolutional-1","title":"Distributed Training of Graph Convolutional Networks using Subgraph Approximation","date":"2020-12-09","arxiv_id":"2012.04930","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-partitioning-using-tensor","title":"Hypergraph Partitioning using Tensor Eigenvalue Decomposition","date":"2020-11-16","arxiv_id":"2011.07683","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-embedding-related-quantum","title":"Optimizing embedding-related quantum annealing parameters for reducing hardware bias","date":"2020-11-02","arxiv_id":"2011.00719","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-topic-extraction-from-vector","title":"Graph-based Topic Extraction from Vector Embeddings of Text Documents: Application to a Corpus of News Articles","date":"2020-10-28","arxiv_id":"2010.15067","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-evolutionary-construction-tree","title":"Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning","date":"2020-08-09","arxiv_id":"2008.03669","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-semantic-instance-segmentation-on","title":"Joint Semantic Instance Segmentation on Graphs with the Semantic Mutex Watershed","date":"2020-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-performance-guarantee-for-spectral","title":"A Performance Guarantee for Spectral Clustering","date":"2020-07-10","arxiv_id":"2007.05627","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-partitioning-and-graph-neural-network","title":"Graph Partitioning and Graph Neural Network based Hierarchical Graph Matching for Graph Similarity Computation","date":"2020-05-16","arxiv_id":"2005.08008","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-affinity-net-instance-segmentation-via","title":"Deep Affinity Net: Instance Segmentation via Affinity","date":"2020-03-15","arxiv_id":"2003.06849","repositories_listed":0,"syntology":null},{"url":null,"slug":"regular-intersection-emptiness-of-graph","title":"Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata","date":"2020-03-12","arxiv_id":"2003.05826","repositories_listed":0,"syntology":null},{"url":null,"slug":"proximity-preserving-binary-code-using-signed","title":"Proximity Preserving Binary Code using Signed Graph-Cut","date":"2020-02-05","arxiv_id":"2002.01793","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-semantic-mutex-watershed-for-efficient","title":"The Semantic Mutex Watershed for Efficient Bottom-Up Semantic Instance Segmentation","date":"2019-12-29","arxiv_id":"1912.12717","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-analysis-of-spectral-algorithm-for","title":"Improved Analysis of Spectral Algorithm for Clustering","date":"2019-12-06","arxiv_id":"1912.02997","repositories_listed":0,"syntology":null},{"url":null,"slug":"correlation-clustering-with-local-objectives","title":"Correlation clustering with local objectives","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-laplacian-and-its-theoretical","title":"Weighted Laplacian and Its Theoretical Applications","date":"2019-11-23","arxiv_id":"1911.10311","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-and-efficient-network-embedding","title":"Initialization for Network Embedding: A Graph Partition Approach","date":"2019-08-28","arxiv_id":"1908.10697","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embeddings-at-scale","title":"Graph Embeddings at Scale","date":"2019-07-03","arxiv_id":"1907.01705","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalized-framework-for-agglomerative","title":"GASP, a generalized framework for agglomerative clustering of signed graphs and its application to Instance Segmentation","date":"2019-06-27","arxiv_id":"1906.11713","repositories_listed":0,"syntology":null},{"url":"/paper/biologically-constrained-graphs-for-global","slug":"biologically-constrained-graphs-for-global","title":"Biologically-Constrained Graphs for Global Connectomics Reconstruction","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"190412654","title":"The Mutex Watershed and its Objective: Efficient, Parameter-Free Graph Partitioning","date":"2019-04-25","arxiv_id":"1904.12654","repositories_listed":0,"syntology":null},{"url":null,"slug":"massively-parallel-benders-decomposition-for","title":"Massively Parallel Benders Decomposition for Correlation Clustering","date":"2019-02-15","arxiv_id":"1902.05659","repositories_listed":0,"syntology":null},{"url":null,"slug":"cosine-compressive-network-embedding-on-large","title":"COSINE: Compressive Network Embedding on Large-scale Information Networks","date":"2018-12-21","arxiv_id":"1812.08972","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-free-text-to-clusters-of-content-in","title":"From Free Text to Clusters of Content in Health Records: An Unsupervised Graph Partitioning Approach","date":"2018-11-14","arxiv_id":"1811.05711","repositories_listed":0,"syntology":null},{"url":null,"slug":"mean-field-theory-of-graph-neural-networks-in","title":"Mean-field theory of graph neural networks in graph partitioning","date":"2018-10-29","arxiv_id":"1810.11908","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-large-scale-graph-neural","title":"Towards Efficient Large-Scale Graph Neural Network Computing","date":"2018-10-19","arxiv_id":"1810.08403","repositories_listed":0,"syntology":null},{"url":"/paper/associating-inter-image-salient-instances-for","slug":"associating-inter-image-salient-instances-for","title":"Associating Inter-Image Salient Instances for Weakly Supervised Semantic Segmentation","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-mutex-watershed-efficient-parameter-free","title":"The Mutex Watershed: Efficient, Parameter-Free Image Partitioning","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"content-driven-unsupervised-clustering-of","title":"Content-driven, unsupervised clustering of news articles through multiscale graph partitioning","date":"2018-08-03","arxiv_id":"1808.01175","repositories_listed":0,"syntology":null},{"url":null,"slug":"supporting-very-large-models-using-automatic","title":"Supporting Very Large Models using Automatic Dataflow Graph Partitioning","date":"2018-07-24","arxiv_id":"1807.08887","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-for-metric-learning-via","title":"Algorithms for metric learning via contrastive embeddings","date":"2018-07-13","arxiv_id":"1807.04881","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-text-to-topics-in-healthcare-records-an","title":"From Text to Topics in Healthcare Records: An Unsupervised Graph Partitioning Methodology","date":"2018-07-07","arxiv_id":"1807.02599","repositories_listed":0,"syntology":null},{"url":null,"slug":"recent-progress-on-graph-partitioning","title":"Recent Progress on Graph Partitioning Problems Using Evolutionary Computation","date":"2018-05-04","arxiv_id":"1805.01623","repositories_listed":0,"syntology":null},{"url":null,"slug":"compassionately-conservative-balanced-cuts","title":"Compassionately Conservative Balanced Cuts for Image Segmentation","date":"2018-03-27","arxiv_id":"1803.09903","repositories_listed":0,"syntology":null},{"url":null,"slug":"replica-symmetry-breaking-in-bipartite-spin","title":"Replica Symmetry Breaking in Bipartite Spin Glasses and Neural Networks","date":"2018-03-17","arxiv_id":"1803.06442","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-optimization-of-scheduling-and-routing","title":"Joint Optimization of Scheduling and Routing in Multicast Wireless Ad-Hoc Network Using Soft Graph Coloring and Non-linear Cubic Games","date":"2018-03-10","arxiv_id":"1803.03736","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-k-groups-via-hartigans-method","title":"Kernel k-Groups via Hartigan's Method","date":"2017-10-26","arxiv_id":"1710.09859","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-acyclic-graph-partitioning","title":"Evolutionary Acyclic Graph Partitioning","date":"2017-09-25","arxiv_id":"1709.08563","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-definition-of-shape-parts-a-dominant","title":"On the definition of Shape Parts: a Dominant Sets Approach","date":"2017-09-11","arxiv_id":"1709.03588","repositories_listed":0,"syntology":null},{"url":null,"slug":"preconditioned-spectral-clustering-for","title":"Preconditioned Spectral Clustering for Stochastic Block Partition Streaming Graph Challenge","date":"2017-08-21","arxiv_id":"1708.07481","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-hash-based-work-distribution-methods-for","title":"On Hash-Based Work Distribution Methods for Parallel Best-First Search","date":"2017-06-10","arxiv_id":"1706.03254","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-partitioning-with-acyclicity","title":"Graph Partitioning with Acyclicity Constraints","date":"2017-04-03","arxiv_id":"1704.00705","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-graph-construction-for-fast-image","title":"Revisiting Graph Construction for Fast Image Segmentation","date":"2017-02-18","arxiv_id":"1702.05650","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-cell-nuclei-segmentation-with-balanced","title":"3D Cell Nuclei Segmentation with Balanced Graph Partitioning","date":"2017-02-17","arxiv_id":"1702.05413","repositories_listed":0,"syntology":null},{"url":null,"slug":"engineering-a-direct-k-way-hypergraph","title":"Engineering a direct k-way Hypergraph Partitioning Algorithm","date":"2017-01-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-cut-based-genetic-algorithm-for-graph","title":"A new cut-based genetic algorithm for graph partitioning applied to cell formation","date":"2016-12-16","arxiv_id":"1612.05536","repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-decomposition-for-nonconvex","title":"Recursive Decomposition for Nonconvex Optimization","date":"2016-11-08","arxiv_id":"1611.02755","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-via-spreading-metrics","title":"Hierarchical Clustering via Spreading Metrics","date":"2016-10-28","arxiv_id":"1610.09269","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-and-community-detection-with","title":"Clustering and Community Detection with Imbalanced Clusters","date":"2016-08-26","arxiv_id":"1608.07605","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-maximal-correlation","title":"Network Maximal Correlation","date":"2016-06-15","arxiv_id":"1606.04789","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-image-boundaries-for-better-video","title":"Improved Image Boundaries for Better Video Segmentation","date":"2016-05-12","arxiv_id":"1605.03718","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-clustering-and-graph-partitioning-via","title":"Data Clustering and Graph Partitioning via Simulated Mixing","date":"2016-03-15","arxiv_id":"1603.04918","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-video-segmentation-using-parametric","title":"Efficient Video Segmentation Using Parametric Graph Partitioning","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-communities-in-the-presence-of","title":"Learning Communities in the Presence of Errors","date":"2015-11-10","arxiv_id":"1511.03229","repositories_listed":0,"syntology":null},{"url":null,"slug":"classifier-based-graph-construction-for-video","title":"Classifier Based Graph Construction for Video Segmentation","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-partitioning-via-parallel-submodular","title":"Graph Partitioning via Parallel Submodular Approximation to Accelerate Distributed Machine Learning","date":"2015-05-18","arxiv_id":"1505.04636","repositories_listed":0,"syntology":null},{"url":null,"slug":"relations-between-adjacency-and-modularity","title":"Relations Between Adjacency and Modularity Graph Partitioning","date":"2015-05-09","arxiv_id":"1505.03481","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistency-of-spectral-hypergraph","title":"Consistency of Spectral Hypergraph Partitioning under Planted Partition Model","date":"2015-05-07","arxiv_id":"1505.01582","repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-road-networks-into-territory","title":"Incorporating Road Networks into Territory Design","date":"2015-04-29","arxiv_id":"1504.07846","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-partitioning-for-independent-sets","title":"Graph Partitioning for Independent Sets","date":"2015-02-05","arxiv_id":"1502.01687","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-graph-partitioning-and-matching","title":"Integrating Graph Partitioning and Matching for Trajectory Analysis in Video Surveillance","date":"2015-02-02","arxiv_id":"1502.00377","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-document-co-reference-resolution-using","title":"Cross-Document Co-Reference Resolution using Sample-Based Clustering with Knowledge Enrichment","date":"2015-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"consistency-of-spectral-partitioning-of","title":"Consistency of Spectral Partitioning of Uniform Hypergraphs under Planted Partition Model","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-power-law-graph-computing","title":"Distributed Power-law Graph Computing: Theoretical and Empirical Analysis","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fgpga-an-efficient-genetic-approach-for","title":"FGPGA: An Efficient Genetic Approach for Producing Feasible Graph Partitions","date":"2014-11-17","arxiv_id":"1411.4379","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-blockmodeling-for-online","title":"Stochastic Blockmodeling for Online Advertising","date":"2014-10-24","arxiv_id":"1410.6714","repositories_listed":0,"syntology":null},{"url":null,"slug":"similarity-driven-semantic-role-induction-via","title":"Similarity-Driven Semantic Role Induction via Graph Partitioning","date":"2014-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"resolution-limit-free-and-local-non-negative","title":"Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering","date":"2014-07-22","arxiv_id":"1407.5924","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-incremental-reseeding-strategy-for","title":"An Incremental Reseeding Strategy for Clustering","date":"2014-06-15","arxiv_id":"1406.3837","repositories_listed":0,"syntology":null},{"url":null,"slug":"augmentative-message-passing-for-traveling","title":"Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning","date":"2014-06-04","arxiv_id":"1406.0941","repositories_listed":0,"syntology":null},{"url":null,"slug":"orientation-robust-text-line-detection-in","title":"Orientation Robust Text Line Detection in Natural Images","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-multiple-clusterings-via-crowd","title":"Combining Multiple Clusterings via Crowd Agreement Estimation and Multi-Granularity Link Analysis","date":"2014-05-06","arxiv_id":"1405.1297","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiscale-dictionary-learning-for-estimating","title":"Multiscale Dictionary Learning for Estimating Conditional Distributions","date":"2013-12-04","arxiv_id":"1312.1099","repositories_listed":0,"syntology":null}],"record_sha256":"9b6b423f3e08c8c28c475ff608e7301ce81e7bd350032a6bb4b0bb9aeed7c5db","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}