Sciweavers

672 search results - page 8 / 135
» Words and forbidden factors
Sort
View
CSDA
2010
132views more  CSDA 2010»
13 years 10 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
DM
2006
134views more  DM 2006»
13 years 9 months ago
Simultaneous graph parameters: Factor domination and factor total domination
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...
Peter Dankelmann, Michael A. Henning, Wayne Goddar...
LATA
2009
Springer
14 years 4 months ago
On a Family of Morphic Images of Arnoux-Rauzy Words
Abstract. In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥ 0 be an integer. Suppose that all left special factors of s longe...
Michelangelo Bucci, Alessandro De Luca
JACM
2007
92views more  JACM 2007»
13 years 9 months ago
Periodicity and unbordered words: A proof of the extended duval conjecture
The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word...
Tero Harju, Dirk Nowotka
SMC
2010
IEEE
202views Control Systems» more  SMC 2010»
13 years 8 months ago
Evaluating the performance of nonnegative matrix factorization for constructing semantic spaces: Comparison to latent semantic a
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
Akira Utsumi