656 search results - page 99 / 132 » Marrying Words and Trees |
ICDAR
2009
IEEE
14 years 9 months ago
2009
IEEE
The sounds generated by a writing instrument provide a rich and under-utilized source of information for pattern recognition. We examine the feasibility of recognition of handwrit...
106
click to vote
KDD
2006
ACM
16 years 6 days ago
2006
ACM
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
100
click to vote
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
124
click to vote
STACS
1992
Springer
15 years 3 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
111
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...