Imagen de Portada

Scaling up archival text analysis with the blockmodeling of n-gram networks -- A case study of Bulgaria's representation in the Osservatore Romano (January-May 1877)

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Telarico, Fabio Ashtar
Formato:	Preprint
Publicado:	2024
Materias:	Digital Libraries Applications Computation Other Statistics 05C15, 68U15, 90C35 05C90, 62P99 I.7; H.5; J.5
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Extending graph total colorings to cell complexes
por: Dejter, Italo J.
Publicado: (2026)

Bayesian Multi-Topology Express Transportation Network Design under Posterior Predictive Demand, Sorting-Efficiency and Delivery-Time Uncertainty
por: Chatterjee, Debashis
Publicado: (2026)

Determining a credit transition matrix from cumulative default probabilities
por: Gzyl, Henryk, et al.
Publicado: (2025)

Bayesian Linear Programming under Learned Uncertainty: Posterior Feasibility Guarantees, Scenario Certification, and Applications
por: Chatterjee, Debashis
Publicado: (2026)

Beyond level-1: Identifiability of a class of galled tree-child networks
por: Allman, Elizabeth S., et al.
Publicado: (2025)

Mean--Variance Risk-Aware Bayesian Optimal Experimental Design for Nonlinear Models
por: Shen, Wanggang, et al.
Publicado: (2026)

Total coloring and efficient domination applications to non-Cayley non-Schreier vertex-transitive graphs
por: Dejter, Italo J.
Publicado: (2020)

Methods for Quantifying Dataset Similarity: a Review, Taxonomy and Comparison
por: Stolte, Marieke, et al.
Publicado: (2023)

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
por: Cameron, Thomas R., et al.
Publicado: (2025)

The Undirected Optical Indices of Trees
por: Lo, Yuan-Hsun, et al.
Publicado: (2018)

Almost Orthogonal Arrays: Search Three Ways
por: Martínez, Luis, et al.
Publicado: (2024)

Entropic Risk-Averse Generalized Momentum Methods
por: Can, Bugra, et al.
Publicado: (2022)

An Empirical Comparison of Methods for Quantifying the Similarity of Categorical Datasets
por: Stolte, Marieke, et al.
Publicado: (2026)

An Empirical Comparison of Methods for Quantifying the Similarity of Numeric Datasets
por: Stolte, Marieke, et al.
Publicado: (2026)

A generalisation of the chance-constrained Charnes-Cooper approach
por: Díaz-García, José A., et al.
Publicado: (2025)

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
por: Tanaka, Masato, et al.
Publicado: (2021)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
por: Barkel, Mathijs, et al.
Publicado: (2026)

Generalized Steepest Descent Methods on Riemannian Manifolds and Hilbert Spaces: Convergence Analysis and Stochastic Extensions
por: A., Rashid, et al.
Publicado: (2025)

Abstract questionnaires and FS-decision digraphs
por: Chen, Jiaye, et al.
Publicado: (2025)

Multi-Iteration Stochastic Optimizers
por: Carlon, Andre, et al.
Publicado: (2020)

A simulation-optimization approach for fractional, profitability-oriented inventory control under service-level type constraints
por: Sun, Tianxiao, et al.
Publicado: (2026)

Randomized quasi-Monte Carlo methods for risk-averse stochastic optimization
por: Melnikov, Olena, et al.
Publicado: (2024)

Tight factorizations of girth-$g$-regular graphs
por: Dejter, Italo J.
Publicado: (2021)

Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation
por: Yan, Chen, et al.
Publicado: (2024)

Splitting Algorithms for Distributionally Robust Optimization
por: Briceño-Arias, Luis, et al.
Publicado: (2024)

Bayesian Sequential Optimal Experimental Design for Nonlinear Models Using Policy Gradient Reinforcement Learning
por: Shen, Wanggang, et al.
Publicado: (2021)

Existence of solutions for polyhedral convex set optimization problems
por: Löhne, Andreas
Publicado: (2023)

A solution method for arbitrary polyhedral convex set optimization problems
por: Löhne, Andreas
Publicado: (2023)

Identifying circular orders for blobs in phylogenetic networks
por: Rhodes, John A., et al.
Publicado: (2024)

Predict-then-Calibrate: A New Perspective of Robust Contextual LP
por: Sun, Chunlin, et al.
Publicado: (2023)

Metric properties of electrical networks and the graph reconstruction problems
por: Gorbounov, V. G., et al.
Publicado: (2026)

BISTRO -- A Bi-Fidelity Stochastic Gradient Framework using Trust-Regions for Optimization Under Uncertainty
por: Dixon, Thomas O., et al.
Publicado: (2025)

Multi-objective stochastic linear programming with recourse and flexible decision making
por: Hamel, Andreas H., et al.
Publicado: (2024)

Mixed-integer linear programming for computing optimal experimental designs
por: Harman, Radoslav, et al.
Publicado: (2023)

Sample Average Approximation for Stochastic Programming with Equality Constraints
por: Lew, Thomas, et al.
Publicado: (2022)

Some thoughts and experiments on Bergman's compact amalgamation problem
por: Joswig, Michael, et al.
Publicado: (2023)

On Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems
por: Cheung, Dennis, et al.
Publicado: (2003)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
por: Traoré, Cheik, et al.
Publicado: (2025)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
por: Zhang, Rui-Jin, et al.
Publicado: (2025)

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
por: Qiu, Songqiang, et al.
Publicado: (2023)