114 search results - page 13 / 23 » Some Notes on Pseudo-closed Sets |
119
click to vote
SWAT
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
JCISE
2002
14 years 10 months ago
2002
The first Technical Note in this series [1] introduced the international standard ISO 10303, informally known as STEP (STandard for the Exchange of Product model data). Subsequent...
104
Voted
TCS
2010
14 years 8 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—Performance of cross-layer protocols that recommend the relay of corrupted packets to higher layers can be improved significantly by accurately inferring/predicting the bit erro...
PCM
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we are proposing a new mechanism for controlling 3D (three dimensional) avatars to create user-designed peculiar motions of avatars in real-time using general interf...