435 search results - page 26 / 87 » Partitioning Search Spaces of a Randomized Search |
ADC
2003
Springer
15 years 2 months ago
2003
Springer
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
COMPGEOM
1998
ACM
15 years 1 months ago
1998
ACM
Computing the visibility of out-door scenes is often much harder than of in-door scenes. A typical urban scene, for example, is densely occluded, and it is effective to precompute...
103
click to vote
ICPP
2005
IEEE
15 years 3 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
88
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...