2063 search results - page 47 / 413 » connection 2007 |
CORR
2007
Springer
14 years 10 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
LADC
2007
Springer
15 years 4 months ago
2007
Springer
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities defining the system. Another characterizing dimension of these ...
STACS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
STOC
2007
ACM
15 years 11 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
COMSWARE
2007
IEEE
15 years 5 months ago
2007
IEEE
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...