Guardado en:
| Autor principal: | Jiao, Bo |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2308.14279 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Computing crossing numbers with topological and geometric restrictions
por: Hamm, Thekla, et al.
Publicado: (2024)
por: Hamm, Thekla, et al.
Publicado: (2024)
Hashing for Sampling-Based Estimation
por: Aamand, Anders, et al.
Publicado: (2024)
por: Aamand, Anders, et al.
Publicado: (2024)
Node ranking in labeled networks
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)
Faster algorithms for k-Orthogonal Vectors in low dimension
por: Dürr, Anita, et al.
Publicado: (2025)
por: Dürr, Anita, et al.
Publicado: (2025)
Are there graphs whose shortest path structure requires large edge weights?
por: Bernstein, Aaron, et al.
Publicado: (2023)
por: Bernstein, Aaron, et al.
Publicado: (2023)
Fast Sampling Based Sketches for Tensors
por: Swartworth, William, et al.
Publicado: (2024)
por: Swartworth, William, et al.
Publicado: (2024)
Tight Sampling Bounds for Eigenvalue Approximation
por: Swartworth, William, et al.
Publicado: (2024)
por: Swartworth, William, et al.
Publicado: (2024)
Sample-Based Matroid Prophet Inequalities
por: Fu, Hu, et al.
Publicado: (2024)
por: Fu, Hu, et al.
Publicado: (2024)
On the Adversarial Robustness of Online Importance Sampling
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)
Dimension-Free Correlated Sampling for the Hypersimplex
por: Joseph, et al.
Publicado: (2025)
por: Joseph, et al.
Publicado: (2025)
Optimal Phylogenetic Reconstruction from Sampled Quartets
por: Arvanitakis, Dionysis, et al.
Publicado: (2026)
por: Arvanitakis, Dionysis, et al.
Publicado: (2026)
Online Sampling and Decision Making with Low Entropy
por: Hajiaghayi, Mohammad Taghi, et al.
Publicado: (2021)
por: Hajiaghayi, Mohammad Taghi, et al.
Publicado: (2021)
Efficient Computation of Periods and Covers Using Sampling
por: Lecroq, Thierry, et al.
Publicado: (2024)
por: Lecroq, Thierry, et al.
Publicado: (2024)
Optimal FIFO grouping in public transit networks
por: Steil, Patrick
Publicado: (2023)
por: Steil, Patrick
Publicado: (2023)
Counting and Sampling Labeled Chordal Graphs in Polynomial Time
por: Hebert-Johnson, Ursula, et al.
Publicado: (2023)
por: Hebert-Johnson, Ursula, et al.
Publicado: (2023)
Weighted Reservoir Sampling With Replacement from Data Streams
por: Meligrana, Adriano, et al.
Publicado: (2024)
por: Meligrana, Adriano, et al.
Publicado: (2024)
Efficient Leverage Score Sampling for Tensor Train Decomposition
por: Bharadwaj, Vivek, et al.
Publicado: (2024)
por: Bharadwaj, Vivek, et al.
Publicado: (2024)
Perfect Sampling in Turnstile Streams Beyond Small Moments
por: Woodruff, David P., et al.
Publicado: (2025)
por: Woodruff, David P., et al.
Publicado: (2025)
Stochastic Minimum Spanning Trees with a Single Sample
por: Hoeksma, Ruben, et al.
Publicado: (2024)
por: Hoeksma, Ruben, et al.
Publicado: (2024)
Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
por: Hébert-Johnson, Úrsula, et al.
Publicado: (2025)
por: Hébert-Johnson, Úrsula, et al.
Publicado: (2025)
Perfect $L_p$ Sampling with Polylogarithmic Update Time
por: Swartworth, William, et al.
Publicado: (2025)
por: Swartworth, William, et al.
Publicado: (2025)
Revisit the Partial Coloring Method: Prefix Spencer and Sampling
por: Cai, Dongrun, et al.
Publicado: (2024)
por: Cai, Dongrun, et al.
Publicado: (2024)
Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
por: Eden, Talya, et al.
Publicado: (2025)
por: Eden, Talya, et al.
Publicado: (2025)
Faster feasibility for dynamic flows and transshipments on temporal networks
por: Sheridan, Kristin, et al.
Publicado: (2024)
por: Sheridan, Kristin, et al.
Publicado: (2024)
QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
por: Bonnet, Édouard, et al.
Publicado: (2026)
por: Bonnet, Édouard, et al.
Publicado: (2026)
Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
por: Lokshtanov, Daniel, et al.
Publicado: (2026)
por: Lokshtanov, Daniel, et al.
Publicado: (2026)
Single-Pass Streaming CSPs via Two-Tier Sampling
por: Azarmehr, Amir, et al.
Publicado: (2026)
por: Azarmehr, Amir, et al.
Publicado: (2026)
Minimizing Makespan in Sublinear Time via Weighted Random Sampling
por: Fu, Bin, et al.
Publicado: (2026)
por: Fu, Bin, et al.
Publicado: (2026)
Improved Sublinear-time Moment Estimation using Weighted Sampling
por: Bhattacharya, Anup, et al.
Publicado: (2025)
por: Bhattacharya, Anup, et al.
Publicado: (2025)
Sample and Expand: Discovering Low-rank Submatrices With Quality Guarantees
por: Ciaperoni, Martino, et al.
Publicado: (2025)
por: Ciaperoni, Martino, et al.
Publicado: (2025)
Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
por: Narayanan, Shyam, et al.
Publicado: (2024)
por: Narayanan, Shyam, et al.
Publicado: (2024)
Uniform Sampling of Negative Edge Weights in Shortest Path Networks
por: Geis, Lukas, et al.
Publicado: (2024)
por: Geis, Lukas, et al.
Publicado: (2024)
Solving the all pairs shortest path problem after minor update of a large dense graph
por: Liu, Gangli
Publicado: (2024)
por: Liu, Gangli
Publicado: (2024)
Rapid mixing in positively weighted restricted Boltzmann machines
por: Feng, Weiming, et al.
Publicado: (2026)
por: Feng, Weiming, et al.
Publicado: (2026)
Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
por: Bodwin, Greg, et al.
Publicado: (2023)
por: Bodwin, Greg, et al.
Publicado: (2023)
Tight Bounds for Sampling q-Colorings via Coupling from the Past
por: Ding, Tianxing, et al.
Publicado: (2025)
por: Ding, Tianxing, et al.
Publicado: (2025)
$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
por: Lin, Honghao, et al.
Publicado: (2025)
por: Lin, Honghao, et al.
Publicado: (2025)
AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling
por: Lee, Seoyong, et al.
Publicado: (2026)
por: Lee, Seoyong, et al.
Publicado: (2026)
Sampling permutations satisfying constraints within the lopsided local lemma regime
por: He, Kun, et al.
Publicado: (2024)
por: He, Kun, et al.
Publicado: (2024)
New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
por: Braverman, Mark, et al.
Publicado: (2024)
por: Braverman, Mark, et al.
Publicado: (2024)
Ejemplares similares
-
Computing crossing numbers with topological and geometric restrictions
por: Hamm, Thekla, et al.
Publicado: (2024) -
Hashing for Sampling-Based Estimation
por: Aamand, Anders, et al.
Publicado: (2024) -
Node ranking in labeled networks
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025) -
Faster algorithms for k-Orthogonal Vectors in low dimension
por: Dürr, Anita, et al.
Publicado: (2025) -
Are there graphs whose shortest path structure requires large edge weights?
por: Bernstein, Aaron, et al.
Publicado: (2023)