435 search results - page 2 / 87 » Partitioning Search Spaces of a Randomized Search |
106
click to vote
CVPR
2001
IEEE
16 years 1 months ago
2001
IEEE
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...
DEXA
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
ISBI
2004
IEEE
16 years 9 days ago
2004
IEEE
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
110
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
112
click to vote
ISCC
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....