20066 search results - page 177 / 4014 » T Spaces |
148
click to vote
ECCC
2010
15 years 6 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
144
click to vote
SCL
2008
15 years 6 months ago
2008
This article extends results on regular implementablity in [3] and [8] to the case when the signal space is not an injective cogenerator, for instance, the space D of compactly su...
APAL
2005
15 years 6 months ago
2005
Abstract. We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Tur...
130
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF(q). When q is prime, we prove that Gn(q) is equal to...
185
click to vote
TIP
1998
15 years 6 months ago
1998
—In this work, we present a segmentation algorithm for color images that uses the watershed algorithm to segment either the twodimensional (2-D) or the three-dimensional (3-D) co...