1274 search results - page 102 / 255 » The Geometry of Coin-Weighing Problems |
199
click to vote
COMPGEOM
2009
ACM
16 years 26 days ago
2009
ACM
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
176
click to vote
COMPGEOM
2009
ACM
16 years 26 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
176
click to vote
COMPGEOM
2009
ACM
16 years 26 days ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
168
click to vote
COMPGEOM
2006
ACM
16 years 10 days ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
240
click to vote
COMPGEOM
2011
ACM
14 years 10 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...