Sciweavers

589 search results - page 18 / 118
» Generalized Dominators and Post-Dominators
Sort
View
ICDCS
2010
IEEE
13 years 10 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—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...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
INFOCOM
2011
IEEE
13 years 1 months ago
Scheduling for small delay in multi-rate multi-channel wireless networks
—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...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...
NIPS
2004
13 years 11 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
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...
Massimiliano Pavan, Marcello Pelillo
FSS
2007
136views more  FSS 2007»
13 years 9 months ago
Retrieving images in fuzzy object-relational databases using dominant color descriptors
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...
Jesús Chamorro-Martínez, Juan Miguel...
JCT
2006
93views more  JCT 2006»
13 years 9 months ago
Dominating sets in k-majority tournaments
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...
Noga Alon, Graham Brightwell, Hal A. Kierstead, Al...