1274 search results - page 96 / 255 » The Geometry of Coin-Weighing Problems |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
GRAPHICSINTERFACE
2007
14 years 11 months ago
2007
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-s...
103
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...