Sciweavers

956 search results - page 7 / 192
» Packing Patterns into Words
Sort
View
IANDC
2007
66views more  IANDC 2007»
13 years 7 months ago
Exponential lower bounds for the number of words of uniform length avoiding a pattern
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
Jason P. Bell, Teow Lim Goh
CVPR
2007
IEEE
14 years 9 months ago
Discovery of Collocation Patterns: from Visual Words to Visual Phrases
A visual word lexicon can be constructed by clustering primitive visual features, and a visual object can be described by a set of visual words. Such a "bag-of-words" re...
Junsong Yuan, Ying Wu, Ming Yang
ICPR
2004
IEEE
14 years 8 months ago
Italic Font Recognition Using Stroke Pattern Analysis on Wavelet Decomposed Word Images
This paper describes an italic font recognition method using stroke pattern analysis on wavelet decomposed word images. The word images are extracted from scanned text documents c...
Chew Lim Tan, Li Zhang, Yue Lu
COLING
2008
13 years 9 months ago
Using Hidden Markov Random Fields to Combine Distributional and Pattern-Based Word Clustering
Word clustering is a conventional and important NLP task, and the literature has suggested two kinds of approaches to this problem. One is based on the distributional similarity a...
Nobuhiro Kaji, Masaru Kitsuregawa
TCS
2011
13 years 2 months ago
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...
Donatella Merlini, Renzo Sprugnoli