Sciweavers

27 search results - page 5 / 6
» Minimum Clique Partition in Unit Disk Graphs
Sort
View
INFOCOM
2011
IEEE
12 years 9 months ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 5 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
13 years 12 months ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck
NETWORKS
2002
13 years 5 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
COCOON
2005
Springer
13 years 11 months ago
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
Xiang-Yang Li, Peng-Jun Wan