Results 1  10
of
882,167
The Ring of kRegular Sequences
, 1992
"... The automatic sequence is the central concept at the intersection of formal language theory and number theory. It was introduced by Cobham, and has been extensively studied by Christol, Kamae, Mendes France and Rauzy, and other writers. Since the range of automatic sequences is nite, however, their ..."
Abstract

Cited by 62 (12 self)
 Add to MetaCart
The automatic sequence is the central concept at the intersection of formal language theory and number theory. It was introduced by Cobham, and has been extensively studied by Christol, Kamae, Mendes France and Rauzy, and other writers. Since the range of automatic sequences is nite, however
The Ring of kregular Sequences, II
, 2003
"... In this paper, we continue our study of kregular sequences begun in 1992. We prove some new results, give many new examples from the literature, and state some open problems. ..."
Abstract
 Add to MetaCart
In this paper, we continue our study of kregular sequences begun in 1992. We prove some new results, give many new examples from the literature, and state some open problems.
The Encyclopedia of Integer Sequences
"... This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs ..."
Abstract

Cited by 866 (15 self)
 Add to MetaCart
This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae
A greedy algorithm for aligning DNA sequences
 J. COMPUT. BIOL
, 2000
"... For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy a ..."
Abstract

Cited by 576 (16 self)
 Add to MetaCart
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy
Multiple sequence alignment with the Clustal series of programs
 Nucleic Acids Res
, 2003
"... The Clustal series of programs are widely used in molecular biology for the multiple alignment of both nucleic acid and protein sequences and for preparing phylogenetic trees. The popularity of the programs depends on a number of factors, including not only the accuracy of the results, but also the ..."
Abstract

Cited by 725 (5 self)
 Add to MetaCart
The Clustal series of programs are widely used in molecular biology for the multiple alignment of both nucleic acid and protein sequences and for preparing phylogenetic trees. The popularity of the programs depends on a number of factors, including not only the accuracy of the results, but also
The homogeneous coordinate ring of a toric variety
, 1992
"... This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each onedimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X) of ..."
Abstract

Cited by 478 (7 self)
 Add to MetaCart
This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each onedimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X
A Critical Point For Random Graphs With A Given Degree Sequence
, 2000
"... Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 the ..."
Abstract

Cited by 511 (8 self)
 Add to MetaCart
Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0
On maximumsized kregular matroids
, 1997
"... Let k be an integer exceeding one. The class of k–regular matroids is a generalization of the classes of regular and nearregular matroids. A simple rank–r regular matroid has the maximum number of points if and only if it is isomorphic to M(Kr+1), the cycle matroid of the complete graph on r + 1 ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Let k be an integer exceeding one. The class of k–regular matroids is a generalization of the classes of regular and nearregular matroids. A simple rank–r regular matroid has the maximum number of points if and only if it is isomorphic to M(Kr+1), the cycle matroid of the complete graph on r + 1
On the kregular sequences and the generalization of Fmodules
 J. Korean Math. Soc
"... Abstract. For a given ideal I of a Noetherian ring R and an arbitrary integer k 1, we apply the concept of kregular sequences and the notion of kdepth to give some results on modules called kCohen Macaulay modules, which in local case, is exactly the kmodules (as a generalization of fmodules) ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. For a given ideal I of a Noetherian ring R and an arbitrary integer k 1, we apply the concept of kregular sequences and the notion of kdepth to give some results on modules called kCohen Macaulay modules, which in local case, is exactly the kmodules (as a generalization of f
KSVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
, 2006
"... In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype signalatoms, signals are described by sparse linear combinations of these atoms. Applications that use sparse representation are many and inc ..."
Abstract

Cited by 930 (41 self)
 Add to MetaCart
and include compression, regularization in inverse problems, feature extraction, and more. Recent activity in this field has concentrated mainly on the study of pursuit algorithms that decompose signals with respect to a given dictionary. Designing dictionaries to better fit the above model can be done
Results 1  10
of
882,167