2194 search results - page 3 / 439 » Improving HLRTA*( k ) |
CPC
2011
13 years 4 months ago
2011
We show that the number of halving sets of a set of n points in R4 is O n4−1/18 , improving the previous bound of [9] with a simpler (albeit similar) proof.
HAIS
2010
Springer
13 years 10 months ago
2010
Springer
JCB
2008
13 years 9 months ago
2008
We define new measures of sequence similarity for oligonucleotide probe design. These new measures incorporate the nearest neighbor k-stem motifs in their definition, but can be e...
SIGMETRICS
1998
ACM
14 years 1 months ago
1998
ACM
COMBINATORICS
2004
13 years 9 months ago
2004
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...