1689 search results - page 263 / 338 » Proximate point searching |
138
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
129
Voted
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
165
Voted
CRV
2008
IEEE
15 years 10 months ago
2008
IEEE
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
124
Voted
CVPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a new method to partition an unlabeled dataset, called Discriminative Context Partitioning (DCP). It is motivated by the idea of splitting the dataset based only on how...
198
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...