2131 search results - page 335 / 427 » Immunity for Closed Sets |
116
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
113
click to vote
SWAT
1998
Springer
15 years 4 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
STOC
2005
ACM
16 years 2 days ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
103
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Many applications require a computer representation of 2D shape, usually described by a set of 2D points. The challenge of this representation is that it must not only capture the...