140 search results - page 4 / 28 » Random projection algorithms for convex set intersection pro... |
138
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
138
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
119
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
147
Voted
COMPGEOM
1996
ACM
15 years 6 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
160
Voted
COMPGEOM
2001
ACM
15 years 6 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...