131 search results - page 6 / 27 » On the Maximum Number of Translates in a Point Set |
APPROX
2004
Springer
15 years 2 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
114
click to vote
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
ICMLA
2004
14 years 10 months ago
2004
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...
SIBGRAPI
2005
IEEE
15 years 3 months ago
2005
IEEE
The design of W-operators from a set of input/output examples for large windows is a hard problem. From the statistical standpoint, it is hard because of the large number of examp...
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...