240 search results - page 12 / 48 » Maximal Contiguous Degrees |
INFOCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
132
click to vote
TC
2011
14 years 4 months ago
2011
—Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Since a large fraction of chip area is devoted to on-...
115
click to vote
KDD
2003
ACM
15 years 10 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
105
click to vote
IFIPTCS
2010
14 years 7 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
COMBINATORICS
2007
14 years 9 months ago
2007
In this paper, we prove that in a multigraph whose density Γ exceeds the maximum vertex degree ∆, the collection of minimal clusters (maximally dense sets of vertices) is cycle...