970 search results - page 13 / 194 » On encodings of spanning trees |
ASIAMS
2007
IEEE
14 years 1 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
ISMIR
2005
Springer
14 years 29 days ago
2005
Springer
This paper describes a music analyzing system called the automatic time-span tree analyzer (ATTA), which we have developed. The ATTA derives a time-span tree that assigns a hierar...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
: In this paper, we investigate the problem to find an acyclic subhypergraph in a given hypergraph, which is an extension to find a tree in a graph. First, we introduce a spannin...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...