Výsledky vyhľadávania - Near-Linear Time Algorithm~

Near-linear-time algorithm for the geodetic Radon number of grids Autor Dourado, Mitre Costa, Pereira de Sá, Vinícius Gusmão, Rautenbach, Dieter, Szwarcfiter, Jayme Luiz

“… The proposed algorithm runs in near-linear O(d(logd)1/2) time for grids of arbitrary sizes, and in sub-linear O(logd…”
Získať plný text

Near linear time algorithm to detect community structures in large-scale networks Autor Raghavan, Usha Nandini, Albert, Réka, Kumara, Soundar

“… Currently used algorithms that identify the community structures in large-scale real-world networks require a priori information such as the number and sizes of communities or are computationally expensive…”
Získať plný text

ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy Autor Jiang, Zihan, Mao, Fubing, Guo, Yapu, Liu, Xu, Liu, Haikun, Liao, Xiaofei, Jin, Hai, Zhang, Wei

“… To address this issue, we propose ACGraph, a novel streaming graph processing approach for monotonic graph algorithms…”
Získať plný text

A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes Autor Cao, Bin, Xu, Chao

“… For a given sequence of planes, we develop a faster algorithm for solving the ALP with the running time O ( n log n…”
Získať plný text

Subspace exploration: Bounds on Projected Frequency Estimation Autor Cormode, Graham, Dickens, Charlie, Woodruff, David P

“…Given an n × d dimensional dataset A, a projection query specifies a subset C ⊆ [d] of columns which yields a new n × |C| array. We study the space complexity…”
Zistit podrobnosti o prístupe

A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification Under the Fréchet Distance Autor Sivignon, Isabelle

“…In this paper, we propose an algorithm that, from a maximum error and a digital curve (4- or 8-connected…”
Získať plný text

A Near-Linear Time Guaranteed Algorithm for Digital Curve Autor Sivignon, Isabelle

Získať plný text

Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection Autor Ou, Jinwen

“… We present efficient approximation algorithms with near-linear-time complexities…”
Získať plný text

Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for Mixable/Exp-Concave Losses Autor Gokcesu, Kaan, Gokcesu, Hakan

“… The best dynamic estimation sequence that we compete against is selected in hindsight with full observation of the loss functions and is allowed to select different optimal estimations in different time intervals (segments…”
Získať plný text

Near-Linear Time Approximation Algorithms for Curve Simplification Autor Agarwal, Pankaj K., Har-Peled, Sariel, Mustafa, Nabil H., Wang, Yusu

Získať plný text

A near-linear time algorithm for haplotype determination on general pedigrees Autor Doan, Duong D, Evans, Patricia A, Horton, Joseph D

“…Abstract An O(nmα(m)) time algorithm is given for inferring haplotypes from genotypes of non-recombinant pedigree data, where n is the number of members, m is the number of sites, and α(m…”
Zistit podrobnosti o prístupe

A Unified Framework to Estimate Global and Local Graphlet Counts for Streaming Graphs Autor Chen, Xiaowei, Lui, John C.S.

“… nature of the input, sheer size of the graphs, and superlinear time complexity of the problem…”
Získať plný text

The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches Autor Bansal, M.S., Eulenstein, O., Wehe, A.

“…) provide a novel near-linear time algorithm for the NNI search problem, 2) introduce extensions that significantly enlarge the search space of the NNI search problem, and 3…”
Získať plný text

HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs Autor Stolman, Andrew, Matulef, Kevin

“…We introduce HyperHeadTail, a streaming algorithm for estimating the degree distribution of a graph from a stream of edges using very little storage space…”
Získať plný text

Streaming Graph Sampling with Size Restrictions Autor Zakrzewska, Anita, Bader, David A.

“…Many graph datasets originating from online social network, financial or biological sources are too large to store or analyze. The analysis of such networks…”
Získať plný text

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut Autor Cheng, Yu, Li, Max, Lin, Honghao, Tai, Zi-Yi, Woodruff, David P, Zhang, Jason

“… directed cut, the total weight of edges in one direction is at most times that in the other direction. We consider two models…”
Zistit podrobnosti o prístupe

Force-Directed Graph Layouts by Edge Sampling Autor Gove, Robert

“…Recent work shows that sampling algorithms can be an effective tool for graph visualization…”
Získať plný text

Near-linear convergence of the Random Osborne algorithm for Matrix Balancing Autor Altschuler, Jason M., Parrilo, Pablo A.

“… of Osborne’s algorithm converges in near-linear time in the input sparsity. Specifically, it balances K ∈ R ≥ 0 n × n after O ( m ε - 2 log κ…”
Získať plný text

Edit Distance in Near-Linear Time: it's a Constant Factor Autor Andoni, Alexandr, Nosatzki, Negev Shekel

“… (equivalently, there is a near-linear additive approximation). In contrast, our algorithm obtains a constant-factor approximation in near-linear running time for any input…”
Získať plný text

A Near-Linear Time Algorithm for the Chamfer Distance Autor Bakshi, Ainesh, Indyk, Piotr, Jayaram, Rajesh, Silwal, Sandeep, Waingarten, Erik

“…)\)-time brute force algorithm. Further, the Chamfer distance is often used as a proxy for the more computationally demanding Earth-Mover (Optimal Transport) Distance. However, the \emph{quadratic} dependence on \(n…”
Získať plný text