6833 search results - page 210 / 1367 » Some two-character sets |
139
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
We present some fundamental structural properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edg...
106
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
119
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
112
click to vote
IJAC
2006
15 years 4 months ago
2006
: It is given a structural conjugacy invariant in the set of pseudowords whose finite factors are factors of a given subshift. Some profinite semigroup tools are developed for this...
143
click to vote
COMBINATORICS
2007
15 years 4 months ago
2007
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...