520 search results - page 58 / 104 » Subset Counting in Trees |
DASFAA
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
AAAI
1996
13 years 9 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
ENDM
2010
13 years 8 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
ENTCS
2007
13 years 7 months ago
2007
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we mo...
SIAMDM
2008
13 years 7 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...