Sciweavers

370 search results - page 6 / 74
» Independent Sets with Domination Constraints
Sort
View
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 1 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
TAPSOFT
1989
Springer
13 years 11 months ago
Independence of Negative Constraints
In the 1820's Fourier provided the first algorithm for solving linear arithmetic constraints. In other words, this algorithm determines whether or not the polyhedral set asso...
Jean-Louis Lassez, Ken McAloon
UAI
1998
13 years 8 months ago
Measure Selection: Notions of Rationality and Representation Independence
We take another look at the general problem of selecting a preferred probability measure among those that comply with some given constraints. The dominant role that entropy maximi...
Manfred Jaeger
PROPERTYTESTING
2010
13 years 5 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
IJCNN
2000
IEEE
13 years 11 months ago
Fuzzy Clustering Algorithm Extracting Principal Components Independent of Subsidiary Variables
Fuzzy c-varieties (FCV) is one of the clustering algorithms in which the prototypes are multi-dimensional linear varieties. The linear varieties are represented by some local prin...
Chi-Hyon Oh, Hirokazu Komatsu, Katsuhiro Honda, Hi...