Sciweavers

725 search results - page 30 / 145
» Bounding Degrees on RPL
Sort
View
DAM
2007
52views more  DAM 2007»
14 years 9 months ago
On the degree of homogeneous bent functions
Abstract. It is well known that the degree of a 2m-variable bent function is at most m. However, the case in homogeneous bent functions is not clear. In this paper, it is proved th...
Qingshu Meng, Huanguo Zhang, Min Yang, Jingsong Cu...
INFOCOM
2005
IEEE
15 years 3 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
IMC
2010
ACM
14 years 7 months ago
On the impact of layer-2 on node degree distribution
The Internet topology data collected through traceroute exploration has been extensively studied in the past. In particular, a remarkable property of the Internet, the power-law s...
Pascal Mérindol, Benoit Donnet, Olivier Bon...
COCO
2010
Springer
144views Algorithms» more  COCO 2010»
15 years 1 months ago
A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan...
SAC
2000
ACM
15 years 2 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
Günther R. Raidl, Bryant A. Julstrom