589 search results - page 18 / 118 » Generalized Dominators and Post-Dominators |
188
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 6 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
186
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
167
click to vote
NIPS
2004
15 years 7 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
171
click to vote
FSS
2007
15 years 6 months ago
2007
In this paper a fuzzy approach for image retrieval on the basis of color features is presented. The proposal deals with vagueness in the color description and introduces the use o...
165
click to vote
JCT
2006
15 years 6 months ago
2006
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...