435 search results - page 4 / 87 » Partitioning Search Spaces of a Randomized Search |
DAWAK
2005
Springer
14 years 10 days ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
AAAI
2007
13 years 9 months ago
2007
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
DEXA
2010
Springer
13 years 4 months ago
2010
Springer
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
SC
2005
ACM
14 years 11 days ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...