6404 search results - page 272 / 1281 » Blocks |
148
click to vote
DM
2010
15 years 6 months ago
2010
A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a...
156
click to vote
EJC
2008
15 years 6 months ago
2008
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...
168
click to vote
ARSCOM
2000
15 years 6 months ago
2000
The minimum number of incomplete blocks required to cover, exactly times, all t-element subsets from a set V of cardinality v (v > t) is denoted
140
click to vote
PPL
2007
15 years 6 months ago
2007
Abstract. List-based implementations of sets are a fundamental building block of many concurrent algorithms. A skiplist based on the lock-free list-based set algorithm of Michael w...
122
click to vote
MA
2010
Springer
15 years 5 months ago
2010
Springer
The problem of subsampling in two-sample and K-sample settings is addressed where both the data and the statistics of interest take values in general spaces. We focus on the case ...