1403 search results - page 184 / 281 » Set cover algorithms for very large datasets |
123
click to vote
NIPS
2003
15 years 7 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
165
Voted
CGF
2010
15 years 6 months ago
2010
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
116
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Many real-world optimization problems have several, usually conflicting objectives. Evolutionary multi-objective optimization usually solves this predicament by searchin...
171
click to vote
COMPGEOM
2010
ACM
15 years 11 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 ...
176
Voted
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...