Výsledky vyhledávání - "sublinear-time algorithms"

Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions

Autoři: Jiawei Huang Wenjie Liu Hu Ding

Zdroj: Lecture Notes in Computer Science ISBN: 9789819610891

Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model

Autoři: Feng, Weiming Li, Zelin Peng, Pan

Témata: Machine Learning, Social and Information Networks (cs.SI), FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Social and Information Networks, Machine Learning (cs.LG)

Přístupová URL adresa: http://arxiv.org/abs/2509.13112

Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction

Autoři: Bshouty, Nader H.

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)

Přístupová URL adresa: http://arxiv.org/abs/2504.02387

Sublinear Time Algorithms and Complexity of Approximate Maximum Matching

Autoři: Behnezhad, Soheil Roghani, Mohammad Rubinstein, Aviad

Zdroj: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. :267-280

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2211.15843

Sublinear-time Algorithms for Stress Minimization in Graph Drawing

Autoři: James G. Wood Seok-Hee Hong Amyra Meidiana

Zdroj: 2021 IEEE 14th Pacific Visualization Symposium (PacificVis). :166-175

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/apvis/pacificvis2021.html#MeidianaWH21
https://ieeexplore.ieee.org/document/9438727/

Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders

Autoři: Peng, Pan Yoshida, Yuichi

Zdroj: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2210.12601

Range partitioning within sublinear time: Algorithms and lower bounds

Autoři: Shouxu Jiang Baoling Ning Jianzhong Li

Zdroj: Theoretical Computer Science. 857:177-191

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S030439752100030X
https://doi.org/10.1016/j.tcs.2021.01.017
https://dblp.uni-trier.de/db/journals/tcs/tcs857.html#NingLJ21
http://doi.org/10.1016/j.tcs.2021.01.017

Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance

Autoři: Tomasz Kociumaka Barna Saha

Zdroj: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). :1168-1179

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/2007.12762
http://arxiv.org/abs/2007.12762
https://arxiv.org/pdf/2007.12762
https://arxiv.org/abs/2007.12762
http://ui.adsabs.harvard.edu/abs/2020arXiv200712762K/abstract
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-12762

Sublinear Time Algorithms for Several Geometric Optimization (With Outliers) Problems In Machine Learning

Autoři: Ding, Hu

Témata: Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Computer Science - Machine Learning, text

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

Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables

Autoři: Felix Krahmer Bosu Choi Mark A. Iwen

Zdroj: Foundations of Computational Mathematics. 21:275-329

Témata: FOS: Mathematics, Mathematics - Numerical Analysis, Numerical Analysis (math.NA)

Přístupová URL adresa: http://arxiv.org/pdf/1808.04932
http://arxiv.org/abs/1808.04932
https://link.springer.com/article/10.1007/s10208-020-09462-z
https://ui.adsabs.harvard.edu/abs/2018arXiv180804932C/abstract
https://doi.org/10.1007/s10208-020-09462-z
https://dblp.uni-trier.de/db/journals/focm/focm21.html#ChoiIK21

Sublinear- Time Algorithms for Compressive Phase Retrieval

Autoři: Yi Li Vasileios Nakos School of Physical and Mathematical Sciences a další

Přispěvatelé: Yi Li Vasileios Nakos School of Physical and Mathematical Sciences a další

Zdroj: 2018 IEEE International Symposium on Information Theory (ISIT). :2301-2305

Témata: Mathematics [Science], Phase Measurement, FOS: Computer and information sciences, Decoding, Computer Science - Information Theory, Information Theory (cs.IT), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Signal Processing Algorithms, 13. Climate action, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Computer science and engineering [Engineering], Data Structures and Algorithms (cs.DS)

Přístupová URL adresa: http://arxiv.org/pdf/1709.02917
http://arxiv.org/abs/1709.02917
https://arxiv.org/abs/1709.02917
https://dblp.uni-trier.de/db/journals/corr/corr1709.html#abs-1709-02917
https://arxiv.org/pdf/1709.02917.pdf
https://dr.ntu.edu.sg/handle/10356/142571
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3262103
https://dblp.uni-trier.de/db/journals/tit/tit66.html#LiN20
https://ieeexplore.ieee.org/document/9181593
https://hdl.handle.net/10356/161218
https://hdl.handle.net/10356/142571

Sublinear-Time Algorithms for Tournament Graphs

Autoři: Dantchev, Stefan Friedetzky, Tom Nagel, Lars a další

Přispěvatelé: Dantchev, Stefan Friedetzky, Tom Nagel, Lars a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642028816

Témata: Sublinear-time algorithms, 13. Climate action, Random walk, 0102 computer and information sciences, 14. Life underwater, 15. Life on land, 16. Peace & justice, Tournament, 01 natural sciences, 7. Clean energy

Přístupová URL adresa: https://link.springer.com/chapter/10.1007%2F978-3-642-02882-3_46
https://dblp.uni-trier.de/db/conf/cocoon/cocoon2009.html#DantchevFN09
https://link.springer.com/content/pdf/10.1007/978-3-642-02882-3_46.pdf
https://dro.dur.ac.uk/6272/
https://core.ac.uk/display/265036
http://doi.org/10.1007/978-3-642-02882-3_46
https://rd.springer.com/chapter/10.1007/978-3-642-02882-3_46
https://dblp.uni-trier.de/db/journals/jco/jco22.html#DantchevFN11
https://link.springer.com/article/10.1007/s10878-010-9325-7
https://link.springer.com/content/pdf/10.1007%2Fs10878-010-9325-7.pdf

stability yields sublinear time algorithms for geometric optimization in machine learning

Autoři: Ding, Hu Hu Ding

Přispěvatelé: Ding, Hu Hu Ding

Témata: machine learning, geometric optimization, ddc:004, stability, sublinear time

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2021/14619/
https://doi.org/10.4230/LIPIcs.ESA.2021.38
https://drops.dagstuhl.de/opus/volltexte/2021/14619/pdf/LIPIcs-ESA-2021-38.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.38

Sublinear Time Algorithms and Complexity of Approximate Maximum Matching

Autoři: Behnezhad, Soheil Roghani, Mohammad Rubinstein, Aviad

Témata: Computer Science - Data Structures and Algorithms, text

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

Sublinear-Time Algorithms for Max Cut, Max E2Lin$(q)$, and Unique Label Cover on Expanders

Autoři: Peng, Pan Yoshida, Yuichi

Témata: Computer Science - Data Structures and Algorithms, text

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

Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance

Autoři: Kociumaka, Tomasz Saha, Barna

Témata: Computer Science - Data Structures and Algorithms, text

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

Introduction to Sublinear Time Algorithms

Zdroj: Algorithms for Big Data ISBN: 9789811204739

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling

Autoři: Maryam Aliakbarpour Amartya Shankha Biswas Themis Gouleakis a další

Přispěvatelé: Maryam Aliakbarpour Amartya Shankha Biswas Themis Gouleakis a další

Zdroj: Springer US

Témata: 4. Education, 0206 medical engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://dspace.mit.edu/bitstream/1721.1/115241/1/453_2017_287_ReferencePDF.pdf
https://dl.acm.org/doi/10.1007/s00453-017-0287-3
https://doi.org/10.1007/s00453-017-0287-3
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica80.html#AliakbarpourBGP18
https://link.springer.com/article/10.1007/s00453-017-0287-3
https://orcid.org/0000-0002-6514-3761
https://orcid.org/0000-0002-4056-0489
https://orcid.org/0000-0002-3466-6543
http://hdl.handle.net/1721.1/115241
https://orcid.org/0000-0001-5064-3221
https://orcid.org/0000-0002-4353-7639

Sublinear-Time Algorithms for Approximating Graph Parameters

Autoři: Dana Ron

Zdroj: Lecture Notes in Computer Science ISBN: 9783319919072

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2F978-3-319-91908-9_7.pdf
https://link.springer.com/chapter/10.1007%2F978-3-319-91908-9_7
https://dblp.uni-trier.de/db/series/lncs/lncs10000.html#Ron19

Sublinear-time algorithms for monomer–dimer systems on bounded degree graphs

Autoři: Marc Lelarge Hang Zhou Lelarge, Marc a další

Přispěvatelé: Marc Lelarge Hang Zhou Lelarge, Marc a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642450297

Témata: FOS: Computer and information sciences, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Discrete Mathematics (cs.DM), Matchings, Probability (math.PR), 0102 computer and information sciences, 02 engineering and technology, Random sampling, 01 natural sciences, Approximation algorithms, Correlation decay, 13. Climate action, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Graph algorithms, Mathematics - Probability, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1208.3629.pdf
http://arxiv.org/abs/1208.3629
https://inria.hal.science/hal-01090580v1/document
https://doi.org/10.1016/j.tcs.2014.06.040
https://inria.hal.science/hal-01090580v1
https://ui.adsabs.harvard.edu/abs/2012arXiv1208.3629L/abstract
https://hal.inria.fr/hal-01090580
http://www.sciencedirect.com/science/article/pii/S0304397514005003
https://www.sciencedirect.com/science/article/pii/S0304397514005003
https://dblp.uni-trier.de/db/journals/tcs/tcs548.html#LelargeZ14
https://www.normalesup.org/~zhou/files/talks/ISAAC13.pdf
https://dblp.uni-trier.de/db/conf/isaac/isaac2013.html#LelargeZ13
https://link.springer.com/chapter/10.1007%2F978-3-642-45030-3_14
https://hal.inria.fr/hal-00917432