Search Sciweavers | Sciweavers

28

JPDC
2007

191views more JPDC 2007»

Clustering wireless ad hoc networks with weakly connected dominating set

13 years 7 months ago

The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconﬁguration and self-management. Efﬁcient clus...

Bo Han, Weijia Jia

claim paper

Read More »

13

click to vote

ACS
2005

68views Distributed And Parallel Com...» more ACS 2005»

Weakly Terminal Objects in Quasicategories of SET Endofunctors

13 years 7 months ago

Download www.karlin.mff.cuni.cz

The quasicategory Q of all set functors (i.e. endofunctors of the category SET of all sets and mappings) and all natural transformations has a terminal object

Libor Barto

claim paper

Read More »

31

click to vote

GLOBECOM
2006
IEEE

161views Communications» more GLOBECOM 2006»

Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks

14 years 1 months ago

Download anyserver.cityu.edu.hk

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

claim paper

Read More »

25

click to vote

APPROX
2004
Springer

179views Algorithms» more APPROX 2004»

Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method

14 years 23 days ago

Download www.mit.edu

ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...

David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz

claim paper

Read More »

10

click to vote

DAM
2007

48views more DAM 2007»

The fractional weak discrepancy of a partially ordered set

13 years 7 months ago

$The fractional weak discrepancy of a partially ordered set$