Sciweavers

34 search results - page 1 / 7
» Fast Methods for Kernel-Based Text Analysis
Sort
View
ACL
2003
13 years 5 months ago
Fast Methods for Kernel-Based Text Analysis
Kernel-based learning (e.g., Support Vector Machines) has been successfully applied to many hard problems in Natural Language Processing (NLP). In NLP, although feature combinatio...
Taku Kudo, Yuji Matsumoto
ICML
2004
IEEE
14 years 4 months ago
Distribution kernels based on moments of counts
Many applications in text and speech processing require the analysis of distributions of variable-length sequences. We recently introduced a general kernel framework, rational ker...
Corinna Cortes, Mehryar Mohri
CHI
1998
ACM
13 years 7 months ago
An Efficient Text Input Method for Pen-Based Computers
Pen-based computing has not yet taken off, partly because of the lack of fast and easy text input methods. The situation is even worse for people using East Asian languages, where...
Toshiyuki Masui
ICDAR
2011
IEEE
12 years 3 months ago
Super-Resolved Binarization of Text Based on the FAIR Algorithm
—In this paper, we present a novel approach for super-resolved binarization of document images acquired by low quality devices. The algorithm tries to compute the super resolutio...
Thibault Lelore, Frédéric Bouchara
ICDAR
2007
IEEE
13 years 10 months ago
Fast Lexicon-Based Scene Text Recognition with Sparse Belief Propagation
Using a lexicon can often improve character recognition under challenging conditions, such as poor image quality or unusual fonts. We propose a flexible probabilistic model for c...
Jerod J. Weinman, Erik G. Learned-Miller, Allen R....