Výsledky vyhledávání - "linear complexity algorithm"

Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices

Autoři: I. Gohberg Y. Eidelman

Zdroj: Computers & Mathematics with Applications. 33:69-79

Témata: Semiseparable matrices, Computational Mathematics, Computational Theory and Mathematics, Modelling and Simulation, semiseparable matrices, linear complexity algorithm, inversion formulas, 0101 mathematics, Linear complexity algorithm, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0898122197000084

Distributed Tree Kernels

Autoři: ZANZOTTO, FABIO MASSIMO Dell'Arciprete, L. Zanzotto, Fm a další

Přispěvatelé: ZANZOTTO, FABIO MASSIMO Dell'Arciprete, L. Zanzotto, Fm a další

Témata: Feature space, Linear complexity algorithm, Low-dimensional space, NAtural language processing, Space complexity, Tree kernels, Settore INF/01 - INFORMATICA, Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI

Relation: ispartofbook:Proceedings of International Conference on Machine Learning (ICML) - http://www.scimagojr.com/journalsearch.php?q=21100217201&tip=sid&clean=0 (GGS Conference Rating 1 A++); International Conference on Machine Learning; lastpage:--; http://hdl.handle.net/2108/105914; http://icml.cc/2012/papers/111.pdf

Dostupnost: http://hdl.handle.net/2108/105914
http://icml.cc/2012/papers/111.pdf

Computation of external approximations of isothetic domains

Autoři: Martynchik, V. N.

Témata: linear complexity algorithm, Parallel algorithms in computer science, rectilinear polygon

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/892053

Uniform sampling of bi-colored random graph

Autoři: Lin, Andi Kryven, I.V. (Thesis Advisor)

Témata: We propose a near-linear complexity algorithm for uniform sampling of simple random graphs with bi-colored edges imposed by two given colored degree sequences. This problem is also known as three-colour discrete tomography and is closely related to the sequence packing problem, both of which are known to be NP hard in the general setting, Master Thesis, Student Thesis

URL: https://studenttheses.uu.nl/handle/20.500.12932/496