1516 search results - page 67 / 304 » On the Learnability of Vector Spaces |
104
click to vote
SEBD
1997
14 years 11 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
JANCL
2002
14 years 9 months ago
2002
We investigate the major mathematical theories of space from a modal standpoint: topology, affine geometry, metric geometry, and vector algebra. This allows us to see new fine-str...
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
We give new recursive constructions of complete caps in PG(n, 2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to ...
CPE
1998
Springer
15 years 2 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...