4095 search results - page 115 / 819 » How to test a tree |
NETWORKS
2008
13 years 10 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
TCS
2010
13 years 8 months ago
2010
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
B
1998
Springer
14 years 2 months ago
1998
Springer
This paper reports on the preparation of test cases using a prototype within the context of a formal development. It describes an approach to building a prototype using an example....
ICDE
2010
IEEE
14 years 10 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
FPL
2008
Springer
13 years 12 months ago
2008
Springer
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...