601 search results - page 100 / 121 » Edge-dominating cycles in graphs |
RE
2006
Springer
13 years 8 months ago
2006
Springer
Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between...
WADS
2001
Springer
14 years 1 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
ECOOP
2005
Springer
14 years 2 months ago
2005
Springer
Library writers wish to provide a guarantee not only that each procedure in the library performs correctly in isolation, but also that the procedures perform correctly when run in ...