4137 search results - page 2 / 828 » On the number of matchings of a tree |
ICPP
1987
IEEE
13 years 8 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract— In this paper we present a topological map building algorithm based on a Vocabulary Tree that is robust to features present in dynamic or similar environments. The algo...
DASFAA
2004
IEEE
13 years 9 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
ICDE
1995
IEEE
14 years 6 months ago
1995
IEEE
We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we...
ICIP
2006
IEEE
14 years 6 months ago
2006
IEEE
Recent studies in linear inverse problems have recognized the sparse representation of unknown signal in a certain basis as an useful and effective prior information to solve thos...