ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2102.11037
  4. Cited By
Highly Fast Text Segmentation With Pairwise Markov Chains
v1v2 (latest)

Highly Fast Text Segmentation With Pairwise Markov Chains

17 February 2021
E. Azeraf
E. Monfrini
Emmanuel Vignon
W. Pieczynski
ArXiv (abs)PDFHTML

Papers citing "Highly Fast Text Segmentation With Pairwise Markov Chains"

4 / 4 papers shown
Title
Real-time Pollutant Identification through Optical PM Micro-Sensor
Elie Azeraf
Audrey Wagner
Emilie Bialic
Samia Mellah
Ludovic Lelandais
65
0
0
13 Mar 2025
Deriving discriminative classifiers from generative models
Deriving discriminative classifiers from generative models
E. Azeraf
E. Monfrini
W. Pieczynski
19
1
0
03 Jan 2022
On equivalence between linear-chain conditional random fields and hidden
  Markov chains
On equivalence between linear-chain conditional random fields and hidden Markov chains
E. Azeraf
E. Monfrini
W. Pieczynski
BDL
18
2
0
14 Nov 2021
Improving usual Naive Bayes classifier performances with Neural Naive
  Bayes based models
Improving usual Naive Bayes classifier performances with Neural Naive Bayes based models
E. Azeraf
E. Monfrini
W. Pieczynski
BDL
31
13
0
14 Nov 2021
1