414 search results - page 21 / 83 » Geometric Semigroup Theory |
COMPGEOM
2009
ACM
14 years 2 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...
JOLLI
1998
13 years 7 months ago
1998
This paper shows how proof nets can be used to formalize the notion of “incomplete dependency” used in psycholinguistic theories of the unacceptability of center-embedded const...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
NGC
2006
Springer
13 years 7 months ago
2006
Springer
This paper examines two seemingly unrelated qualitative spatial reasoning domains; geometric proportional analogies and topographic (landcover) maps. We present a Structure Matchin...
CVPR
2009
IEEE
14 years 2 months ago
2009
IEEE
Maximum likelihood (ML) estimation is widely used in many computer vision problems involving the estimation of geometric parameters, from conic fitting to bundle adjustment for s...