221 search results - page 4 / 45 » Random Indexing K-tree |
MIR
2010
ACM
14 years 15 days ago
2010
ACM
ICDT
1999
ACM
13 years 10 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
VLDB
2002
ACM
13 years 5 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
TSD
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. This paper suggests a novel representation for documents that is intended to improve precision. This representation is generated by combining two central techniques: Rand...
ICIP
2004
IEEE
14 years 7 months ago
2004
IEEE
This paper describes a computational model for deriving a decomposition of objects from laser rangefinder data. The process aims to produce a set of parts defined by compactness a...