1127 search results - page 172 / 226 » Testing the Expansion of a Graph |
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
CVPR
2006
IEEE
15 years 3 months ago
2006
IEEE
Many natural and man-made structures have a boundary that shows certain level of bilateral symmetry, a property that has been used to solve many computer-vision tasks. In this pap...
GLVLSI
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper presents a systematic design methodology for yield enhancement of asynchronous logic circuits using 3-D (3-Dimensional) integration technology. In this design, the targ...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using...
FCT
2005
Springer
15 years 3 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...