Výsledky vyhľadávania - "Linear-time algorithm"

A linear-time algorithm for Gaussian and non-Gaussian trait evolution models Autor Ho, Lam si Tung, Ané, Cécile

“…We developed a linear-time algorithm applicable to a large class of trait evolution models, for efficient likelihood calculations and parameter inference on very large trees…”
Zistit podrobnosti o prístupe

A linear time algorithm for linearizing quadratic and higher-order shortest path problems: A linear time algorithm for linearizing quadratic Autor Çela, Eranda, Klinz, Bettina, Lendl, Stefan, Woeginger, Gerhard J., Wulf, Lasse

“… We provide a novel linear time algorithm for the LinQSPP on acyclic digraphs which runs considerably faster than the previously best algorithm…”
Získať plný text

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow Autor Brand, Jan Van Den, Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Gutenberg, Maximilian Probst, Sachdeva, Sushant, Sidford, Aaron

“…We give a deterministic m^{1+o(1)} time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially…”
Získať plný text

A Linear Time Algorithm for the Optimal Discrete IRS Beamforming Autor Ren, Shuyi, Shen, Kaiming, Li, Xin, Chen, Xin, Luo, Zhi-Quan

“…It remains an open problem to find the optimal configuration of phase shifts under the discrete constraint for intelligent reflecting surface (IRS) in…”
Získať plný text

Linear-Time Algorithm for Computing the Bernstein–Bézier Coefficients of B-spline Basis Functions Autor Chudy, Filip, Woźny, Paweł

“…A new differential-recurrence relation for the B-spline functions of the same degree is proved. From this relation, a recursive method of computing the…”
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

“…Community detection and analysis is an important methodology for understanding the organization of various real-world networks and has applications in problems…”
Získať plný text

Scalable GWR: A Linear-Time Algorithm for Large-Scale Geographically Weighted Regression with Polynomial Kernels Autor Murakami, Daisuke, Tsutsumida, Narumasa, Yoshida, Takahiro, Nakaya, Tomoki, Lu, Binbin

“…Although a number of studies have developed fast geographically weighted regression (GWR) algorithms for large samples, none of them has achieved linear-time…”
Získať plný text

Linear-time algorithm for sliding tokens on trees Autor Demaine, Erik D., Demaine, Martin L., Fox-Epstein, Eli, Hoang, Duc A., Ito, Takehiro, Ono, Hirotaka, Otachi, Yota, Uehara, Ryuhei, Yamada, Takeshi

“…Suppose that we are given two independent sets Ib and Ir of a graph such that |Ib|=|Ir|, and imagine that a token is placed on each vertex in Ib. Then, the…”
Získať plný text

A simple scalable linear time algorithm for horizontal visibility graphs Autor Schmidt, Jonas, Köhne, Daniel

“…Horizontal Visibility Graphs establish a connection between time series and complex networks. As a feature, they have shown strong results in time series…”
Získať plný text

A linear-time algorithm for trust region problems Autor Hazan, Elad, Koren, Tomer

“…We consider the fundamental problem of minimizing a general quadratic function over an ellipsoidal domain, also known as the trust region (sub)problem. We give…”
Získať plný text

A linear-time algorithm for minimum k-hop dominating set of a cactus graph Autor Abu-Affash, A. Karim, Carmi, Paz, Krasin, Adi

“… In this paper, we present a linear-time algorithm that finds a minimum k-hop dominating set in cactus graphs, which improves the O(n3…”
Získať plný text

A linear time algorithm for linearizing quadratic and higher-order shortest path problems Autor Çela, Eranda, Klinz, Bettina, Lendl, Stefan, Woeginger, Gerhard J., Wulf, Lasse

“… We provide a novel linear time algorithm for the LinQSPP on acyclic digraphs which runs considerably faster than the previously best algorithm…”
Získať plný text

Linear time algorithm for computing min‐max movement of sink‐based mobile sensors for line barrier coverage Autor Zou, Wenjie, Guo, Longkun, Huang, Peihuang, Lin, Geng, Mei, Hengquan

“…Witnessing broad energy‐critical applications of barrier coverage in mobile and wireless sensor networks, emerging practical applications have recently brought…”
Získať plný text

A Linear-Time Algorithm for Testing Outer-1-Planarity Autor Hong, Seok-Hee, Eades, Peter, Katoh, Naoki, Liotta, Giuseppe, Schweitzer, Pascal, Suzuki, Yusuke

“… We present a linear time algorithm to test whether a given graph is outer-1-planar. The algorithm can be used to produce an outer-1-planar embedding in linear time…”
Získať plný text

Mutual-visibility in distance-hereditary graphs: a linear-time algorithm Autor Cicerone, Serafino, Stefano, Gabriele Di

“…The concept of mutual-visibility in graphs has been recently introduced. If X is a subset of vertices of a graph G, then vertices u and v are X-visible if…”
Získať plný text

A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions Autor Karmarkar, Tanmaya, Lucet, Yves

Získať plný text

A simple and fast linear-time algorithm for divisor methods of apportionment Autor Reitzig, Raphael, Wild, Sebastian

“… We show that a simple linear-time algorithm can exactly simulate all instances of the family of divisor methods of apportionment by reducing the problem to a single call to a selection algorithm…”
Získať plný text

A simple linear time algorithm to solve the MIST problem on interval graphs Autor Li, Peng, Shang, Jianhui, Shi, Yi

“… Based on the structure of normal orderings on interval graphs, we present a simple linear time algorithm that solve the problem when restricted to connected interval graphs in this paper…”
Získať plný text

A linear time algorithm for connected p-centdian problem on block graphs Autor Nguyen, Kien Trung, Teh, Wen Chean, Hung, Nguyen Thanh, Nguyen-Thu, Huong

“…We study the problem of finding a set of p connected vertices in a block graph to minimize the convex combination of the median and the center objective…”
Získať plný text

A linear-time algorithm for the center problem in weighted cycle graphs Autor Eom, Taekang, Ahn, Hee-Kap

“…We study the problem of computing the center of cycle graphs whose vertices are weighted. The distance from a vertex to a point of the graph is defined as the…”
Získať plný text