435 search results - page 14 / 87 » Partitioning Search Spaces of a Randomized Search |
164
click to vote
MMM
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
100
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— A hybrid automatic repeat-request (ARQ) code combining scheme employing different multidimensional spacetime trellis codes (MSTTCs) over a multiple-input, multipleoutput (MIMO)...
127
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
166
Voted
DATAMINE
1999
15 years 3 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
114
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
A major problem in metropolitan areas is searching for parking spaces. In this paper, we propose a novel method for parking space detection. Given input video captured by a camera...