Výsledky vyhledávání - Worst-case computational complexity estimation

Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps

Autoři: Kelner, Jonathan Koehler, Frederic Meka, Raghu a další

Témata: Statistics - Machine Learning, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Computer Science - Machine Learning, Mathematics - Statistics Theory, text

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

SUBLINEAR ALGORITHMS FOR LOCAL GRAPH-CENTRALITY ESTIMATION.

Autoři: BRESSAN, MARCO PESERICO, ENOCH PRETTO, LUCA

Zdroj: SIAM Journal on Computing. 2023, Vol. 52 Issue 4, p968-1008. 41p.

Témata: *DIRECTED graphs, *ALGORITHMS, *COMPUTATIONAL complexity, *RANDOM walks, *CENTRALITY

Bounding the Computational Complexity of Flowchart Programs with Multi-dimensional Rankings

Autoři: Alias, Christophe Darte, Alain Feautrier, Paul a další

Přispěvatelé: Alias, Christophe Darte, Alain Feautrier, Paul a další

Témata: Multi-dimensional affine ranking functions, Termination proof, Worst-case computational complexity estimation, Abstract interpretation, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Polyhedral model, Static analysis, [INFO.INFO-ES] Computer Science [cs]/Embedded Systems, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]

Popis souboru: application/pdf

Přístupová URL adresa: https://inria.hal.science/inria-00464356v1

On the time complexity analysis of numerical percolation threshold estimation

Autoři: Solla, Daniel García

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Statistical Mechanics (cond-mat.stat-mech), FOS: Mathematics, FOS: Physical sciences, Mathematics - Numerical Analysis, Disordered Systems and Neural Networks (cond-mat.dis-nn), Numerical Analysis (math.NA), Condensed Matter - Disordered Systems and Neural Networks, Computational Complexity (cs.CC), Condensed Matter - Statistical Mechanics

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

Optimal Parameter Encoding Based on Worst Case Fisher Information Under a Secrecy Constraint

Autoři: Goken C. Gezici S. Gezici, Sinan

Přispěvatelé: Goken C. Gezici S. Gezici, Sinan

Zdroj: IEEE Signal Processing Letters

Témata: Optimization, Fisher information, Errors, Fisher information matrix, mean-squared error (MSE), Secrecy, Mean square error, Signal encoding, Linear minimum mean-squared errors, 02 engineering and technology, Encoding functions, Low complexity algorithm, Computational complexity, secrecy, Encoding (symbols), Optimal parameter, Parameter estimation, 0202 electrical engineering, electronic engineering, information engineering, Mean squared error, Scalar parameters, Mean-squared error (MSE), parameter estimation, optimization

Popis souboru: application/pdf

Přístupová URL adresa: http://repository.bilkent.edu.tr/bitstream/11693/37116/1/Optimal%20Parameter%20Encoding%20Based%20on%20Worst%20Case%20Fisher%20Information%20Under%20a%20Secrecy%20Constraint.pdf
http://dblp.uni-trier.de/db/journals/spl/spl24.html#GokenG17
https://ieeexplore.ieee.org/document/8027055/
https://dblp.uni-trier.de/db/journals/spl/spl24.html#GokenG17
https://hdl.handle.net/11693/37116

A New Information Complexity Measure for Multi-pass Streaming with Applications

Autoři: Mark Braverman Sumegha Garg Qian Li a další

Zdroj: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :1781-1792

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

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

Computational barriers in statistical estimation and reconstruction - Can solutions to the LASSO be computed?

Autoři: Tan, Martine

Zdroj: Tan, Martine. Computational barriers in statistical estimation and reconstruction - Can solutions to the LASSO be computed?. Master thesis, University of Oslo, 2021

Dostupnost: http://hdl.handle.net/10852/87897
https://www.duo.uio.no/bitstream/handle/10852/87897/11/Martine_Tan_masters_thesis.pdf

Computational Complexity of Statistical Inference via Lattices and Short Certificates

Autoři: Tiegel, Stefan J.

Témata: computational statistical gaps, efficient algorithms, reductions and lower bounds

Computational Complexity Meets Statistical Efficiency: From Change Point Estimation to Monotonicity Testing

Autoři: Liu, Zhi Li, Housen Dr. Steinem, Claudia Prof. Dr. a další

Přispěvatelé: Liu, Zhi Li, Housen Dr. Steinem, Claudia Prof. Dr. a další

Témata: false discovery rate, minimax optimality, change points, multiscale method, robust segmentation, wavelet tree, adaptation, isotonic regression, fast computation, randomized algorithm, Mathematics (PPN61756535X)

Time: 510

Dostupnost: http://resolver.sub.uni-goettingen.de/purl?ediss-11858/15933
https://doi.org/10.53846/goediss-11190
https://nbn-resolving.org/urn:nbn:de:gbv:7-ediss-15933-9

Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method

Autoři: Cui, Guanyu Wang, Hanzhi Wei, Zhewei

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

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

Rate-Distortion and Complexity Optimized Motion Estimation for H.264 Video Coding

Autoři: Ateş, Hasan Fehmi Altunbaşak, Yücel

Zdroj: IEEE Transactions on Circuits and Systems for Video Technology. 18:159-171

Témata: Optimization, Rate-distortion (R-D), Motion compensation, Decision, Image coding, Complexity, 02 engineering and technology, Vectors, Motion estimation (ME), Algorithm, Computational complexity, Motion vectors (MV), 0202 electrical engineering, electronic engineering, information engineering, Video coding, H.264, Rate distortion, Algorithms

Popis souboru: application/pdf

Přístupová URL adresa: http://acikerisim.isikun.edu.tr/xmlui/bitstream/11729/300/4/300.pdf
https://hdl.handle.net/11729/300

CRC-Aided Fixed Complexity Error Pattern Estimation Technique

Autoři: Juhee Yun Nulibyul Kim Jaekwon Kim

Zdroj: IEEE Access, Vol 10, Pp 59048-59056 (2022)

Témata: error correction, soft decision, 0202 electrical engineering, electronic engineering, information engineering, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, error pattern, LLR, CRC, TK1-9971

Přístupová URL adresa: https://doaj.org/article/f28239e3818947bb99a63b21dec17b27

Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties.

Autoři: Luo, Hezhi Ding, Xiaodong Peng, Jiming a další

Zdroj: INFORMS Journal on Computing. Winter2021, Vol. 33 Issue 1, p180-197. 18p.

Témata: *ALGORITHMS, *UNCERTAINTY, *FINANCIAL risk, *MATHEMATICAL optimization, *SYSTEMIC risk (Finance), *CONVEX functions

Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method

Autoři: Guanyu Cui Hanzhi Wang Zhewei Wei

Zdroj: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1. :177-188

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

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

Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal

Autoři: Wang, Hanzhi

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

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

Probabilistic quality estimations for combinatorial optimization problems.

Autoři: Vakhania, Nodari¹ nodari@uaem.mx

Zdroj: Georgian Mathematical Journal. Mar2018, Vol. 25 Issue 1, p123-134. 12p.

Témata: *COMBINATORICS, *MATHEMATICAL optimization, *PROBABILITY theory, *APPROXIMATION algorithms, *PARAMETER estimation

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs

Autoři: Dell, Holger Lapinskas, John Meeks, Kitty a další

Přispěvatelé: Dell, Holger Lapinskas, John Meeks, Kitty a další

Zdroj: Dell, H, Lapinskas, J & Meeks, K 2022 'Nearly optimal independence oracle algorithms for edge estimation in hypergraphs'. https://doi.org/10.48550/arXiv.2211.03874

Témata: FOS: Computer and information sciences, cs.CC, Fine-grained complexity, Computational Complexity (cs.CC), Hypergraphs, Computer Science - Computational Complexity, cs.DS, Graph oracles, Approximate counting, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2211.03874
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.54
https://pure.itu.dk/portal/da/publications/d1aca994-848a-49ed-985c-a0052d51930b

APPROXIMATE MAXIMUM LIKELIHOOD METHOD FOR FREQUENCY ESTIMATION

Autoři: Huang, Dawei

Zdroj: Statistica Sinica, 2000 Jan 01. 10(1), 157-171.

Přístupová URL adresa: https://www.jstor.org/stable/24306710

Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal

Autoři: Hanzhi Wang

Zdroj: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. :3036-3044

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

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

STATE ESTIMATION WITH EVENT SENSORS: OBSERVABILITY ANALYSIS AND MULTI-SENSOR FUSION.

Autoři: XINHUI LIU KAIKAI ZHENG DAWEI SHI a další

Zdroj: SIAM Journal on Control & Optimization. 2024, Vol. 62 Issue 1, p167-190. 24p.

Témata: *MULTISENSOR data fusion, *OBSERVABILITY (Control theory), *LINEAR time invariant systems, *DISCRETE-time systems, *DETECTORS, *LINEAR systems, *INFORMATION measurement, *COMPUTATIONAL complexity, *DISTRIBUTED algorithms