The following pages link to (Q4939994):
Displaying 50 items.
- Nonparametric Bayesian topic modelling with the hierarchical Pitman-Yor processes (Q324682) (← links)
- Functional analysis techniques to improve similarity matrices in discrimination problems (Q391805) (← links)
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602) (← links)
- Probabilistic topic models for sequence data (Q399896) (← links)
- Max margin learning of hierarchical configural deformable templates (HCDTs) for efficient object parsing and pose estimation (Q408907) (← links)
- A generic framework for \(n\)-protocol compatibility checking (Q433347) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Harnessing inequality (Q521777) (← links)
- Organizing the Web's information explosion to discover unknown unknowns (Q601132) (← links)
- Consistency of stochastic context-free grammars (Q611793) (← links)
- Uniquely decodable \(n\)-gram embeddings (Q706633) (← links)
- Qualitative reachability in stochastic BPA games (Q719240) (← links)
- Runtime analysis of probabilistic programs with unbounded recursion (Q743128) (← links)
- Optimizing the mutual intelligibility of linguistic agents in a shared world (Q814568) (← links)
- A semiparametric generative model for efficient structured-output supervised learning (Q841642) (← links)
- A note on the expressive power of probabilistic context free grammars (Q851193) (← links)
- Analysis methods for the terminological structure of a subject area (Q891490) (← links)
- Computation of distances for regular and context-free probabilistic languages (Q932320) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← links)
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression (Q973867) (← links)
- Text data mining: theory and methods (Q975565) (← links)
- An algorithm for simulating permutation tests of graph-intersection measures of association (Q1010534) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- Maximum likelihood analysis of algorithms and data structures (Q1041238) (← links)
- Statistical estimation with linguistic data (Q1073472) (← links)
- Web mining with relational clustering (Q1394980) (← links)
- A general family of trimmed estimators for robust high-dimensional data analysis (Q1616324) (← links)
- Inequality spectra (Q1620414) (← links)
- Towards a quantum world wide web (Q1628583) (← links)
- Hybrid PoS-tagging: a cooperation of evolutionary and statistical approaches (Q1630789) (← links)
- A Bayesian model for recognizing handwritten mathematical expressions (Q1669590) (← links)
- An integrated grammar-based approach for mathematical expression recognition (Q1669722) (← links)
- Variation of Zipf's exponent in one hundred live languages: a study of the holy Bible translations (Q1681868) (← links)
- The Viterbi algorithm for subsets of stochastic context-free languages (Q1708272) (← links)
- Gaussian-Gamma collaborative filtering: a hierarchical Bayesian model for recommender systems (Q1741490) (← links)
- Categorization of text documents taking into account some structural features (Q1742433) (← links)
- Marginal median SOM for document organization and retrieval (Q1883878) (← links)
- Modelling highly inflected languages (Q1886781) (← links)
- Recursive compositional models for vision: description and review of recent work (Q1932878) (← links)
- Training parsers by inverse reinforcement learning (Q1959536) (← links)
- Processing text for privacy: an information flow perspective (Q2024330) (← links)
- Syntactic stochastic processes: definitions, models, and related inference problems (Q2051758) (← links)
- VCSEL: prioritizing SNP-set by penalized variance component selection (Q2078274) (← links)
- A mixture model approach to spectral clustering and application to textual data (Q2111310) (← links)
- Feasibility-based fixed point networks (Q2138454) (← links)
- Randomized Newton's method for solving differential equations based on the neural network discretization (Q2161555) (← links)
- Mutually symmetric and complementary triplets: differences in their use distinguish systematically between coding and non-coding genomic sequences (Q2177305) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Efficiently mining cohesion-based patterns and rules in event sequences (Q2218356) (← links)
- Reward is enough (Q2238710) (← links)
