StringologyTimes

Data Structures and Algorithms: 2017/1/15-21

1: Quantum algorithm for multivariate polynomial interpolation
2: Optimal Elephant Flow Detection
3: SF-sketch: A Two-stage Sketch for Data Streams
4: On Estimating Maximum Matching Size in Graph Streams
5: Polynomial-time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs
6: The fast parallel algorithm for CNF SAT without algebra
7: The Medial Axis of a Multi-Layered Environment and its Application as a Navigation Mesh
8: How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals
9: Randomized Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem
10: Efficient Implementation Of Newton-Raphson Methods For Sequential Data Prediction
11: Efficient Information Flow Maximization in Probabilistic Graphs
12: Efficient computation of higher order cumulant tensors
13: Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth’s theorem
14: Bayesian Network Learning via Topological Order
15: Improved Algorithms For Structured Sparse Recovery
16: Algorithm for an arbitrary-order cumulant tensor calculation in a sliding window of data streams
17: A GPU-Based Solution to Fast Calculation of Betweenness Centrality on Large Weighted Networks
18: Observations on Factors Affecting Performance of MapReduce based Apriori on Hadoop Cluster
19: Conflict-Free Coloring of Planar Graphs
20: Reliable Virtual Machine Placement and Routing in Clouds