Sciweavers

4171 search results - page 766 / 835
» Choice numbers of graphs
Sort
View
GLOBECOM
2008
IEEE
15 years 28 days ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
AHSWN
2008
92views more  AHSWN 2008»
15 years 3 hour ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
CORR
2010
Springer
65views Education» more  CORR 2010»
14 years 12 months ago
Statistical properties of subgroups of free groups
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based ...
Frédérique Bassino, Armando Martino,...
CORR
2010
Springer
183views Education» more  CORR 2010»
14 years 12 months ago
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
Alok Ojha, Hongmei Deng, Dharma P. Agrawal, Sugata...
COMGEO
2008
ACM
14 years 12 months ago
Constructing minimum-interference networks
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...