2004 search results - page 337 / 401 » Sampling from large graphs |
PEWASUN
2004
ACM
14 years 3 months ago
2004
ACM
Interferences in an ad-hoc network can be defined as a set of constraints that specify which groups of nodes cannot transmit simultaneously, and they have significant implications...
FSTTCS
2003
Springer
14 years 3 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
HICSS
2000
IEEE
14 years 2 months ago
2000
IEEE
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...
MSS
2000
IEEE
14 years 2 months ago
2000
IEEE
We describe a real implementation of a software component that manages caching of files from a tertiary storage management system to a large disk cache developed for use in the a...
ASPDAC
2000
ACM
14 years 2 months ago
2000
ACM
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...