114 search results - page 13 / 23 » An efficient condition for a graph to be Hamiltonian |
KDD
2007
ACM
14 years 7 months ago
2007
ACM
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Protein fold recognition is a key step towards inferring the tertiary structures from amino-acid sequences. Complex folds such as those consisting of interacting structural repeat...
TVLSI
2002
13 years 7 months ago
2002
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
ICDE
2001
IEEE
14 years 8 months ago
2001
IEEE
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...