174 search results - page 16 / 35 » Connected dominating sets on dynamic geometric graphs |
112
click to vote
DM
2008
15 years 6 months ago
2008
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
181
click to vote
SMI
2006
IEEE
16 years 1 days ago
2006
IEEE
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
138
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
172
click to vote
DCOSS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
187
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— Service discovery is an integral part of the ad hoc networking to achieve stand-alone and self-configurable communication networks. In this paper, we discuss possible service ...