2638 search results - page 65 / 528 » Random Geometric Complexes |
128
Voted
COMPGEOM
2009
ACM
15 years 9 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...
90
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
120
Voted
ISVC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Multi-view range image integration aims at producing a single reasonable 3D point cloud. The point cloud is likely to be inconsistent with the measurements topologically ...
125
Voted
ICCV
2009
IEEE
15 years 10 days ago
2009
IEEE
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...