2356 search results - page 101 / 472 » Characterizations of postman sets |
159
click to vote
KES
2005
Springer
15 years 11 months ago
2005
Springer
This paper discusses a general algorithm for the discovery of motif combinations. From a large number of input motifs, discovered by any single motif discovery tool, our algorithm ...
127
click to vote
ITC
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper studies some manufacturing test data collected for an experimental digital IC. Test results for a large variety of single-stuck fault based test sets are shown and comp...
147
click to vote
PODS
1997
ACM
15 years 10 months ago
1997
ACM
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
160
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
179
click to vote
DCG
2006
15 years 6 months ago
2006
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...