4913 search results - page 96 / 983 » Results and Perspectives of the G |
BPM
2010
Springer
13 years 10 months ago
2010
Springer
Business webs are collections of enterprises designed to jointly satisfy a consumer need. Designing business webs calls for modeling the collaboration of enterprises from different...
WDAG
2000
Springer
14 years 1 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
IWOCA
2010
Springer
13 years 5 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
DM
1998
13 years 10 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
ICCV
2001
IEEE
15 years 6 days ago
2001
IEEE
In this paper we investigate, determine and classify the critical configurations for solving structure and motion problems for 1D retina vision. We give a complete categorization ...