4047 search results - page 292 / 810 » The Discrete Basis Problem |
147
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
140
click to vote
ACSC
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
145
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
204
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
292
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...