Výsledky vyhledávání - "Computer Science - Data Structures and Algorithms"

SciPy 1.0: fundamental algorithms for scientific computing in Python Autor Virtanen, Pauli, Gommers, Ralf, Oliphant, Travis E., Haberland, Matt, Reddy, Tyler, Cournapeau, David, Burovski, Evgeni, Peterson, Pearu, Weckesser, Warren, Bright, Jonathan, van der Walt, Stéfan J., Brett, Matthew, Wilson, Joshua, Millman, K. Jarrod, Mayorov, Nikolay, Nelson, Andrew R. J., Jones, Eric, Kern, Robert, Larson, Eric, Carey, C J, Polat, İlhan, Feng, Yu, Moore, Eric W., VanderPlas, Jake, Laxalde, Denis, Perktold, Josef, Cimrman, Robert, Henriksen, Ian, Quintero, E. A., Harris, Charles R., Archibald, Anne M., Ribeiro, Antônio H., Pedregosa, Fabian, van Mulbregt, Paul

“…SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto…”
Získat plný text

Approximate Counting for Spin Systems in Sub-Quadratic Time Autor Anand, Konrad, Feng, Weiming, Freifeld, Graham, Guo, Heng, Wang, Jiaheng

“…We present two randomised approximate counting algorithms with$\widetilde{O}(n^{2-c}/\varepsilon^2)$running time for some constant$c>0$and…”
Získat plný text

Testing Distributions of Huge Objects Autor Goldreich, Oded, Ron, Dana

“…We initiate a study of a new model of property testing that is a hybrid of testing properties of distributions and testing properties of strings. Specifically,…”
Získat plný text

Fully Dynamic Connectivity in$O(\log n(\log\log n)^2)$Amortized Expected Time Autor Huang, Shang-En, Huang, Dawei, Kopelowitz, Tsvi, Pettie, Seth, Thorup, Mikkel

“…Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure…”
Získat plný text

A Refined Laser Method and Faster Matrix Multiplication Autor Alman, Josh, Williams, Virginia Vassilevska

“…The complexity of matrix multiplication is measured in terms of$\omega$ , the smallest real number such that two$n\times n$matrices can be multiplied…”
Získat plný text

Locally defined independence systems on graphs Autor Yuki Amano

Získat plný text

Optimal Trace Distance and Fidelity Estimations for Pure Quantum States Autor Qisheng Wang

Získat plný text

Approximation Algorithms for Covering Vertices by Long Paths Autor Gong, Mingyang, Edgar, Brett, Fan, Jing, Lin, Guohui, Miyano, Eiji

Získat plný text

Engineering faster double‐array Aho–Corasick automata Autor Shunsuke Kanda, Koichi Akabe, Yusuke Oda

Získat plný text

Approximating Maximum Edge 2-Coloring by Normalizing Graphs Autor Mömke, Tobias, Popa, Alexandru, Roshany-Tabrizi, Aida, Ruderer, Michael, Vincze, Roland

“…In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors. The…”
Získat plný text

Online risk-averse submodular maximization Autor Yuichi Yoshida, Tasuku Soma

Získat plný text

Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs Autor Takuro Fukunaga

Získat plný text

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs Autor Balzotti, Lorenzo

“…A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and…”
Získat plný text

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions Autor Alecu, Bogdan, Kanté, Mamadou Moustapha, Lozin, Vadim, Zamaraev, Viktor

“…Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear…”
Získat plný text

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for$\Delta$ -Coloring Autor Assadi, Sepehr, Kumar, Pankaj, Mittal, Parth

“…Every graph with maximum degree$\Delta$can be colored with$(\Delta+1)$colors using a simple greedy algorithm. Remarkably, recent work has shown that one can…”
Získat plný text

On the Parameterized Intractability of Determinant Maximization Autor Ohsaka, Naoto

Získat plný text

On Approximability of Steiner Tree in$\ell_p$ -metrics Autor Fleischmann, Henry, Gavva, Surya Teja, S, Karthik C.

“…In the Continuous Steiner Tree problem (CST), we are given as input a set of points (called terminals) in a metric space and ask for the minimum-cost tree…”
Získat plný text

Exactly Hittable Interval Graphs Autor Dhannya, S. M., Narayanaswamy, N. S., Nisha, K. K.

“…Given a set system$\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$ , where$\mathcal{U}$is a set of elements and$\mathcal{S}$is a set of subsets of$\mathcal{U}$ , an…”
Získat plný text

PPSZ is better than you think Autor Scheder, Dominik

“…PPSZ, for long time the fastest known algorithm for$k$ -SAT, works by going through the variables of the input formula in random order; each variable is then…”
Získat plný text

Introduction to local certification Autor Feuilloley, Laurent

“…A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its…”
Získat plný text