Search Results - "Sublinear time algorithm"
-
1
Authors:
Source: 2025 Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611978315
-
2
Authors:
Source: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611978322
-
3
Authors: et al.
Source: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. :3593-3602
-
4
Authors:
Source: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611976465
-
5
Authors: et al.
Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, 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, Machine Learning (cs.LG)
Access URL: http://arxiv.org/abs/2208.03367
-
6
Authors: et al.
Index Terms: Sublinear-time algorithms, Subgraph counting, AGM bound, InProceedings, Text, doc-type:ResearchArticle, publishedVersion
URL:
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.6
Is Part Of LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) -
7
Authors: et al.
Contributors: et al.
Source: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019).
Subject Terms: FOS: Computer and information sciences, 000 Computer science, knowledge, general works, AGM bound, Subgraph counting, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Sublinear-time algorithms, Computer Science, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004
File Description: application/pdf
-
8
Authors: et al.
Contributors: et al.
Source: MIT web domain
Subject Terms: 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
File Description: application/pdf
Access URL: http://arxiv.org/pdf/1110.1079
http://arxiv.org/abs/1110.1079
https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.88
https://dl.acm.org/doi/10.5555/2095116.2095204
http://dblp.uni-trier.de/db/journals/corr/corr1110.html#abs-1110-1079
http://dspace.mit.edu/handle/1721.1/72545
https://dblp.uni-trier.de/db/conf/soda/soda2012.html#OnakRRR12
http://people.csail.mit.edu/ronitt/papers/1110.1079v1.pdf
http://hdl.handle.net/1721.1/72545
https://orcid.org/0000-0002-4353-7639 -
9
Authors:
Subject Terms: G.4, FOS: Computer and information sciences, D.2.8, F.2.0, G.2.2, I.1.2, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 68W20, 68W25, 68R10, 68Q25, 68W40
Access URL: http://arxiv.org/abs/1701.08128
-
10
Authors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783642305405
Access URL: https://www.microsoft.com/en-us/research/publication/
sublinear -time -algorithm -pagerank-computations/
https://www.microsoft.com/en-us/research/wp-content/uploads/2016/11/A-Sublinear -Time -Algorithm -for-PageRank.pdf
https://link.springer.com/content/pdf/10.1007/978-3-642-30541-2_4
https://research.microsoft.com/en-us/um/people/borgs/papers/sublinearpr.pdf
https://core.ac.uk/display/22686783
https://link.springer.com/chapter/10.1007/978-3-642-30541-2_4 -
11
Authors:
Source: Lecture Notes in Computer Science ISBN: 9783642145520
Access URL: https://link.springer.com/chapter/10.1007/978-3-642-14553-7_12
https://dblp.uni-trier.de/db/conf/faw/faw2010.html#DingFF10
https://rd.springer.com/chapter/10.1007/978-3-642-14553-7_12
https://link.springer.com/10.1007/978-3-642-14553-7_12
https://ui.adsabs.harvard.edu/abs/2010LNCS.6213..101D/abstract -
12
Authors: et al.
Contributors: et al.
Subject Terms: Sublinear-time algorithms, Subgraph counting, AGM bound
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.6
-
13
Authors: et al.
Source: MIT web domain
Index Terms: Article, http://purl.org/eprint/type/ConferencePaper
URL:
http://hdl.handle.net/1721.1/72545 http://dl.acm.org/citation.cfm?id=2095204 http://dl.acm.org/citation.cfm?id=2095204
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '12) -
14
-
15
Authors:
Subject Terms: FOS: Computer and information sciences, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, Mathematics - Optimization and Control, 01 natural sciences
Access URL: http://arxiv.org/abs/1208.5211
-
16
Authors: et al.
Contributors: et al.
Source: http://people.csail.mit.edu/konak/download/publications/Onak_et_al-near_optimal_vertex_cover.pdf.
File Description: application/pdf
-
17
Authors: et al.
Contributors: et al.
File Description: application/pdf
-
18
Authors: et al.
Contributors: et al.
Subject Terms: Sublinear Time Algorithm, FOS: Computer and information sciences, Effective Resistance, Computer Science - Data Structures and Algorithms, Leverage Scores, Data Structures and Algorithms (cs.DS), ddc:004, Matrix Perturbation
File Description: application/pdf
-
19
Authors: et al.
Contributors: et al.
Subject Terms: Chinese restaurant process, Dirichlet process, sublinear time algorithm, random recursive tree, random permutation, random partition, Ewens distribution, simulation, local access implementation, continuous time embedding
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.28
-
20
Authors:
Source: IEICE Transactions on Information and Systems. 2022, E105.D(3):597
Nájsť tento článok vo Web of Science