A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Journal of the ACM
We present a novel divide-and-conquer paradigm for approximating NP-hard graph optimization problems. ... The paradigm models graph optimization problems that satisfy two properties: First, a divide-and-conquer approach is applicable. ... We can approximate problems that satisfy two properties: divide-and-conquer applicability and spreading metric applicability, defined below. 2.1.1. Divide-and-Conquer Applicability. ...doi:10.1145/347476.347478 fatcat:3zwp3kjri5fidmw4m7kynoznda
This paper proposes an innovative divide-and-conquer approach to improve the efficiency of ART algorithms while maintaining their performance in effectiveness. ... This was achieved through various means such as best candidate selection, exclusion, , and diversity metrics. ... The effectiveness for applying divide-and-conquer technique with respect to these typical failure patterns was studied via simulation. ...doi:10.1109/qsic.2013.19 dblp:conf/qsic/ChowCT13 fatcat:g7dzyy3vfjeepb6xiijljpt3wq
approximation algorithms via spreading metrics. ... Leighton and Rao showed that a dicycle cover of weight O(r log” |V'|) can be found in polynomial time, using their approximation algorithm for balanced cuts and a divide-and-conquer approach. ...
In addition, we define a sequence of new directed spreading metrics that are used for applying the algorithm recursively on smaller subgraphs. ... The new spreading metrics allow us to define an asymmetric region growing procedure that accounts simultaneously for both incoming and outgoing edges. ... Th motivation for considering cuts (as in SphereGrow), is that the cuts are used to find an ordering of the graph via divide and conquer techniques. . . , k − 1) and for every x ∈ S: d k (v, x) < ∆ 2 , ...doi:10.1145/1798596.1798600 fatcat:tl2a4xwpzfdcrm2gdjcswslq44
ap- proximation algorithms via spreading metrics (extended abstract) (62-71); Randeep Bhatia, Samir Khuller and Joseph Naor, The loading time scheduling problem (extended abstract) (72-81); Leslie A. ... and Madhu Sudan, Private informa- tion retrieval (41-50); Jon Kleinberg and Eva Tardos, Disjoint paths in densely embedded graphs (52-61); Guy Even, Joseph Naor, Satish Rao and Baruch Schieber, Divide-and-conquer ...
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Our algorithm uses a semidefinite relaxation which combines 2 2 metrics with spreading metrics. ... This is in contrast to previous approximation algorithms for k-balanced partitioning, which are based on linear programming relaxations and their approximation factor is independent of k. ... by Even, Naor, Rao, and Schieber  in the context of approximation algorithms that employ a divide-and-conquer approach. ...doi:10.1137/1.9781611973068.102 fatcat:ntc25g4i7rb7dao6lb46zec4he
Divide-and-conquer strategies, which split the data into batches and, for each batch, run independent MCMC algorithms targeting the corresponding subposterior, can spread the computational burden across ... This approximation is exploited through three methodologies: firstly a Hamiltonian Monte Carlo algorithm targeting the expectation of the posterior density provides a sample from an approximation to the ... E Logistic regression model -Hepmass data Figure 9 provides box plots for each of the discrepancy metrics and for each divide-and-conquer algorithm. ...arXiv:1605.08576v2 fatcat:acnpplk24ngcnkdqsepherybny
Distributed parallel algorithms for mining frequent balanced itemsets aims to load by equally dividing data among a collection of computing nodes. ... than other predictive methods like Apriori, Randomized algorithms. ... It develops an efficient, FP-tree-based frequent pattern mining method with a divide-and-conquer methodology which decomposes mining tasks into smaller ones and avoids candidate generation. ...doi:10.26483/ijarcs.v8i7.4499 fatcat:keqnovdtojeblocoi4v5skql3e
Metric learning is a key problem for many data mining and machine learning applications, and has long been dominated by Mahalanobis methods. ... This leads to a more robust learning algorithm. ... In the tree setting, we are using SSMMC in a divide-and-conquer fashion-thus, if we assume that we divide the data roughly in half with each SSMMC operation, the complexity of fully training an HFD tree ...arXiv:1402.5565v1 fatcat:awfqaihmzzhytkoji4unsndu4a
From the perspective of methodology, the large-scale MOEAs are categorized into three classes and introduced respectively: divide and conquer based, dimensionality reduction based and enhanced search-based ... While evolutionary algorithms (EAs) have been widely acknowledged as a mainstream method for MOPs, most research progress and successful applications of EAs have been restricted to MOPs with small-scale ... and conquer Public transport network design  2 000 Divide and conquer Resource allocation  1 000 000 Divide and conquer Sparse regression  1 080 000 Divide and conquer Engineering design ...doi:10.1007/s11633-020-1253-0 fatcat:q636cuvarbco7kmnvthnfysa54
Our algorithms rely on off-the-shelf solvers to search for exact Pareto-optimal solutions, and they parallelize the search via collaborative communication, divide-and-conquer, or both. ... We propose five novel parallel algorithms for solving MOCO problems exactly and efficiently. ... Our algorithms search for Pareto-optimal solutions using off-the-shelf solvers and parallelize the search via collaborative communication and divide-and-conquer. ...doi:10.1145/2642937.2642971 dblp:conf/kbse/GuoZORCAA14 fatcat:neniyjnzi5hjzagydl5h7ahlpa
Finally, we discuss approximation algorithms based on convex relaxations. We present a spreading metric SDP relaxation for the problem and show that it has integrality gap at most O(sqrtlog n). ... We also show that a spreading metric LP relaxation gives an O(log n)-approximation. ... On the other hand, we got our initial O(log n) approximation by proving that the hierarchical clustering objective function falls into the divide and conquer approximation algorithms via spreading metrics ...arXiv:1609.09548v1 fatcat:li222tze3jdvjbt72upkzx2eda
We propose a divide and conquer strategy for data mining using both the data-based sensitivity analysis for extracting feature relevance and expert evaluation for splitting the problem of characterizing ... Particularly, several algorithms widely spread for implementing DM techniques tend to adopt tree structures to which divide and conquer strategies are recursively applied to shortcut through the search-space ... Divide and conquer strategy A wide number of divide and conquer strategies have been applied in the machine learning and DM domains. ...doi:10.1111/exsy.12253 fatcat:t6jrg62dk5bqbfsu5z4azd3fb4
It adopted the divide-and-conquer strategy to divide the complex problem into several low dimensional subproblems which become easier to deal with. ... Due to the rapid increase of air traffic demand, the large-scale flight assignment plays a crucial role in reducing airspace congestion and economic losses via reasonably regulating the air traffic flow ... The cooperative co-evolution (CC) algorithm, adopting the divide-and-conquer strategy, divides the complex problem into several low dimensional sub-problems    . ...doi:10.1007/s11432-015-5495-3 fatcat:hxwtbghpbncz7ngmzpct472ple
By recognizing three bare-bones interactions-modularity, hierarchy, and overlap, facetwise models are developed to dissect and inspect problem decomposition in the context of genetic algorithms. ... The proposed genetic algorithm design utilizes a matrix representation of an interaction graph to analyze and explicitly decompose the problem. ... Portuguese Foundation for Science and Technology under grants SFRH/BD/16980/2004 and PTDC/EIA/67776/2006. ...doi:10.1162/evco.2009.17.4.17409 pmid:19916779 fatcat:reozd4525nhj7i5zg2fdx7f55m
« Previous Showing results 1 — 15 out of 1,851 results