589 search results - page 1 / 118 » Matching Concavity Trees |
84
Voted
SSPR
2004
Springer
15 years 2 months ago
2004
Springer
Concavity trees are structures for 2-D shape representation. In this paper, we present a new recursive method for concavity tree matching that returns the distance between two attr...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
y trees are well-known abstract structures. This paper proposes a new shape-based image retrieval method based on concavity trees. The proposed method has two main components. The...
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
ISNN
2005
Springer
15 years 3 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...