Suchergebnisse - "Linear computational complexity"

Fast Causal Discovery by Approximate Kernel-based Generalized Score Functions with Linear Computational Complexity

Autoren: Yixin Ren Haocheng Zhang Yewei Xia et al.

Quelle: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1. :1197-1208

Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, Statistics - Machine Learning, Machine Learning (stat.ML), Machine Learning (cs.LG)

Zugangs-URL: http://arxiv.org/abs/2412.17717

LinGen: Towards High-Resolution Minute-Length Text-to-Video Generation with Linear Computational Complexity

Autoren: Wang, Hongjie Ma, Chih-Yao Liu, Yen-Cheng et al.

Quelle: 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). :2578-2588

Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Computer Vision and Pattern Recognition (cs.CV), Image and Video Processing (eess.IV), Computer Science - Computer Vision and Pattern Recognition, FOS: Electrical engineering, electronic engineering, information engineering, Electrical Engineering and Systems Science - Image and Video Processing, Machine Learning (cs.LG)

Zugangs-URL: http://arxiv.org/abs/2412.09856

BLOCK KALMAN FILTER WITH LINEAR COMPUTATIONAL COMPLEXITY FOR INTEGRATED VISUAL-INERTIAL NAVIGATION SYSTEMS

Autoren: N.I. Tsiopliakis

Quelle: Bulletin of the South Ural State University. Ser. Computer Technologies, Automatic Control & Radioelectronics. 24:43-56

CAPACITY ESTIMATION METHOD WITH LINEAR COMPUTATIONAL COMPLEXITY OF NARROW-BAND IONOSPHERIC DECAMETER CHANNELS WITH PSK-N-SIGNALS

Autoren: Ilya M. Lerner

Quelle: T-Comm. 17:55-66

A novel high-precision non-classical method to solve fractional rheology and viscoelastic vibration: Linear computational complexity and experimental verification

Autoren: Tian-Ming Liu Yan-Mao Chen Ji-Ke Liu et al.

Quelle: International Journal of Solids and Structures. 315:113341

Algorithm for capacity estimation based on time resolution theory with linear computational complexity for frequency-selective communication channels and PAM-n-signals

Autoren: A.N. Khairullin I.M. Lerner T.A. Ayupov

Quelle: Radioengineering. 1

COLAFormer: Communicating local–global features with linear computational complexity

Autoren: Zhengwei Miao Hui Luo Meihui Li et al.

Quelle: Pattern Recognition. 157:110870

Fast Causal Discovery by Approximate Kernel-based Generalized Score Functions with Linear Computational Complexity

Autoren: Ren, Yixin Zhang, Haocheng Xia, Yewei et al.

Index Begriffe: Computer Science - Machine Learning, Statistics - Machine Learning, text

URL: http://arxiv.org/abs/2412.17717

LinGen: Towards High-Resolution Minute-Length Text-to-Video Generation with Linear Computational Complexity

Autoren: Wang, Hongjie Ma, Chih-Yao Liu, Yen-Cheng et al.

Index Begriffe: Computer Science - Computer Vision and Pattern Recognition, Computer Science - Artificial Intelligence, Computer Science - Machine Learning, Electrical Engineering and Systems Science - Image and Video Processing, text

URL: http://arxiv.org/abs/2412.09856

Compression, Inversion, and Approximate PCA of Dense Kernel Matrices at Near-Linear Computational Complexity

Autoren: Florian Schäfer T. J. Sullivan Houman Owhadi

Quelle: Multiscale Modeling & Simulation. 19:688-730

Schlagwörter: FOS: Computer and information sciences, Probability (math.PR), 65F30, 42C40, 65F50, 65N55, 65N75, 60G42, 68Q25, 68W40, Numerical Analysis (math.NA), Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, 0101 mathematics, QA, Mathematics - Probability

Dateibeschreibung: application/pdf

Zugangs-URL: http://wrap.warwick.ac.uk/151700/1/WRAP-compression-inversion-approximate-PCA-dense-kernel-matrices-near-linear-computational-complexity-Sullivan-2021.pdf
http://arxiv.org/abs/1706.02205
https://epubs.siam.org/doi/pdf/10.1137/19M129526X
https://resolver.caltech.edu/CaltechAUTHORS:20170710-083743909
https://arxiv.org/abs/1706.02205
https://authors.library.caltech.edu/78882
http://dblp.uni-trier.de/db/journals/corr/corr1706.html#SchaferSO17
https://dblp.uni-trier.de/db/journals/corr/corr1706.html#SchaferSO17

Exhaustively Identifying Cross-Linked Peptides with a Linear Computational Complexity

Autoren: Yu, Fengchao Li, Ning Yu, Weichuan

Quelle: Journal of Proteome Research. 16:3942-3952

Schlagwörter: Proteomics, 0301 basic medicine, Protein Conformation, 0206 medical engineering, Proteins, 02 engineering and technology, Cross-linked peptides identification, 03 medical and health sciences, Exhaustive database search, Cross-Linking Reagents, Tandem Mass Spectrometry, Linear computational complexity, Humans, Protein Interaction Maps, Databases, Protein, Peptides, Algorithms, Software

Zugangs-URL: https://www.biorxiv.org/content/biorxiv/early/2017/02/27/097089.full.pdf
https://pubmed.ncbi.nlm.nih.gov/28825304
http://www.biorxiv.org/content/early/2017/02/27/097089.full.pdf
https://www.biorxiv.org/content/early/2016/12/28/097089
http://www.biorxiv.org/content/early/2016/12/28/097089
https://www.biorxiv.org/content/10.1101/097089v2
https://pubs.acs.org/doi/10.1021/acs.jproteome.7b00338
https://pubs.acs.org/doi/full/10.1021/acs.jproteome.7b00338
http://pubsdc3.acs.org/doi/abs/10.1021/acs.jproteome.7b00338
https://pubmed.ncbi.nlm.nih.gov/28825304/
https://europepmc.org/article/MED/28825304
https://www.ncbi.nlm.nih.gov/pubmed/28825304
http://biorxiv.org/content/early/2017/02/27/097089.full.pdf
http://biorxiv.org/content/early/2017/02/27/097089.full.pdf+html

FINITE RANK DEEP KERNEL LEARNING WITH LINEAR COMPUTATIONAL COMPLEXITY

Variational inference of fractional Brownian motion with linear computational complexity

Autoren: Verdier, Hippolyte Laurent, François Cassé, Alhassan et al.

Weitere Verfasser: Verdier, Hippolyte Laurent, François Cassé, Alhassan et al.

Quelle: Physical Review E. 106

Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, [SDV.BIBS] Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], [PHYS.PHYS.PHYS-BIO-PH] Physics [physics]/Physics [physics]/Biological Physics [physics.bio-ph], FOS: Physical sciences, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], Quantitative Biology - Quantitative Methods, 01 natural sciences, Machine Learning (cs.LG), Biological Physics (physics.bio-ph), Physics - Data Analysis, Statistics and Probability, FOS: Biological sciences, 0103 physical sciences, Physics - Biological Physics, [PHYS.PHYS.PHYS-DATA-AN] Physics [physics]/Physics [physics]/Data Analysis, Statistics and Probability [physics.data-an], Data Analysis, Statistics and Probability (physics.data-an), Quantitative Methods (q-bio.QM)

Dateibeschreibung: application/pdf

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/36559393
http://arxiv.org/abs/2203.07961
https://hal.science/hal-03612918v3/document
https://doi.org/10.1103/physreve.106.055311
https://hal.science/hal-03612918v3

Blind Source Separation for Mixture of Sinusoids with Near-Linear Computational Complexity

Autoren: Gokcesu, Kaan Gokcesu, Hakan

Schlagwörter: Signal Processing (eess.SP), FOS: Computer and information sciences, Computer Science - Machine Learning, Machine Learning (stat.ML), 02 engineering and technology, Machine Learning (cs.LG), Statistics - Machine Learning, Audio and Speech Processing (eess.AS), Optimization and Control (math.OC), 0202 electrical engineering, electronic engineering, information engineering, FOS: Electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Electrical Engineering and Systems Science - Signal Processing, Mathematics - Optimization and Control, Electrical Engineering and Systems Science - Audio and Speech Processing

Zugangs-URL: http://arxiv.org/abs/2203.14324

Correlation test for code sequence randomness with almost linear computational complexity

Autoren: V.I. Volchikhin A.I. Ivanov A.P. Ivanov et al.

Quelle: Известия высших учебных заведений. Поволжский регион:Технические науки, Iss 3 (2021)

Schlagwörter: Technology, low computational complexity, evaluation of white noise quality, statistical criteria for testing the hypothesis of independence

Zugangs-URL: https://doaj.org/article/26af55bd348c408db8fddeb7e9a37260

L* Algorithm—A Linear Computational Complexity Graph Searching Algorithm for Path Planning

Autoren: Leszek Podsędkowski Adam Niewola

Quelle: Journal of Intelligent & Robotic Systems. 91:425-444

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2Fs10846-017-0748-6.pdf
http://doi.org/10.1007/s10846-017-0748-6
https://dialnet.unirioja.es/servlet/articulo?codigo=6660416
https://link.springer.com/article/10.1007/s10846-017-0748-6
https://link.springer.com/content/pdf/10.1007%2Fs10846-017-0748-6.pdf
https://paperity.org/p/85616950/l-algorithm-a-linear-computational-complexity-graph-searching-algorithm-for-path-planning
https://dblp.uni-trier.de/db/journals/jirs/jirs91.html#NiewolaP18

Nonholonomic mobile robot path planning with linear computational complexity graph searching algorithm

Autoren: Leszek Podsędkowski Adam Niewola

Quelle: 2015 10th International Workshop on Robot Motion and Control (RoMoCo). :217-222

Schlagwörter: 0209 industrial biotechnology, 02 engineering and technology

Zugangs-URL: http://ieeexplore.ieee.org/document/7219738/
https://ieeexplore.ieee.org/document/7219738/
https://dblp.uni-trier.de/db/conf/romoco/romoco2015.html#NiewolaP15

A Third Order Fast Sweeping Method with Linear Computational Complexity for Eikonal Equations

Autoren: Yong-Tao Zhang Liang Wu

Quelle: Journal of Scientific Computing. 62:198-229

Schlagwörter: 2. Zero hunger, 0101 mathematics, 01 natural sciences

Zugangs-URL: https://dl.acm.org/doi/10.1007/s10915-014-9856-7
https://dl.acm.org/citation.cfm?id=2716441
https://link.springer.com/article/10.1007/s10915-014-9856-7/fulltext.html
https://dblp.uni-trier.de/db/journals/jscic/jscic62.html#WuZ15
https://link.springer.com/article/10.1007/s10915-014-9856-7
https://link.springer.com/content/pdf/10.1007%2Fs10915-014-9856-7.pdf

Linear computational complexity design of constrained optimal ILC

Autoren: Michel Verhaegen Aleksandar Haber Rufus Fraanje

Quelle: IEEE Conference on Decision and Control and European Control Conference. :5343-5348

Schlagwörter: 0301 basic medicine, 0209 industrial biotechnology, 03 medical and health sciences, 02 engineering and technology

Zugangs-URL: http://www.nt.ntnu.no/users/skoge/prost/proceedings/cdc-ecc-2011/data/papers/0883.pdf
http://www.nt.ntnu.no/users/skoge/prost/proceedings/cdc-ecc-2011/data/papers/0883.pdf
https://dblp.uni-trier.de/db/conf/cdc/cdc2011.html#HaberFV11
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006160667

Algorithm with Linear Computational Complexity for Batch Scheduling in OBS Networks

Autoren: Nelson L. S. da Fonseca Gustavo B. Figueiredo

Quelle: 2011 IEEE International Conference on Communications (ICC). :1-6

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005962545
http://dblp.uni-trier.de/db/conf/icc/icc2011.html#FigueiredoF11
https://dblp.uni-trier.de/db/conf/icc/icc2011.html#FigueiredoF11