1272 search results - page 50 / 255 » Approximate Parameterized Matching |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising i...
108
click to vote
VISUAL
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. In this paper, we present novel image-derived, invariant features that accurately capture both the geometric and color properties of an imaged object. These features can ...
106
click to vote
ACSC
2005
IEEE
15 years 4 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
AAAI
2007
15 years 1 months ago
2007
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...