414 search results - page 21 / 83 » Geometric Semigroup Theory |
133
Voted
COMPGEOM
2009
ACM
15 years 10 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...
117
Voted
JOLLI
1998
15 years 3 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...
118
click to vote
COMPGEOM
2009
ACM
15 years 10 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...
125
Voted
NGC
2006
Springer
15 years 3 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...
107
Voted
CVPR
2009
IEEE
15 years 10 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...