1729 search results - page 315 / 346 » Bound Graph Polysemy |
136
click to vote
TCS
1998
15 years 4 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
117
Voted
TCS
2002
15 years 4 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
117
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
156
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a dete...
119
Voted
MOR
2010
15 years 3 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...