3008 search results - page 373 / 602 » Independence in connected graphs |
168
click to vote
CCCG
1997
15 years 8 months ago
1997
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
154
click to vote
IJRR
2008
15 years 6 months ago
2008
Recognizing useful modular robot configurations composed of hundreds of modules is a significant challenge. Matching a new modular robot configuration to a library of known configu...
199
click to vote
PAMI
2006
15 years 6 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
199
click to vote
TON
2008
15 years 6 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
213
click to vote
TVCG
2008
15 years 6 months ago
2008
Volume exploration is an important issue in scientific visualization. Research on volume exploration has been focused on revealing hidden structures in volumetric data. While the i...