3008 search results - page 459 / 602 » Independence in connected graphs |
208
Voted
DSN
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
162
click to vote
IMC
2004
ACM
16 years 14 days ago
2004
ACM
The Internet is teeming with high variability phenomena, from measured IP flow sizes to aspects of inferred router-level connectivity, but there still exists considerable debate ...
197
click to vote
GECCO
2004
Springer
16 years 13 days ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
178
click to vote
CVGIP
2007
15 years 7 months ago
2007
Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with po...
214
click to vote
SIGMETRICS
2008
ACM
15 years 7 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...