Sciweavers

443 search results - page 3 / 89
» More on the Size of Higman-Haines Sets: Effective Constructi...
Sort
View
JMLR
2010
124views more  JMLR 2010»
13 years 18 days ago
Multiclass-Multilabel Classification with More Classes than Examples
We discuss multiclass-multilabel classification problems in which the set of classes is extremely large. Most existing multiclass-multilabel learning algorithms expect to observe ...
Ofer Dekel, Ohad Shamir
COLING
2010
13 years 24 days ago
Multilingual Subjectivity: Are More Languages Better?
While subjectivity related research in other languages has increased, most of the work focuses on single languages. This paper explores the integration of features originating fro...
Carmen Banea, Rada Mihalcea, Janyce Wiebe
GLOBECOM
2006
IEEE
13 years 12 months ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
MOBIHOC
2008
ACM
14 years 5 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
FSTTCS
2010
Springer
13 years 3 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...