Sciweavers

1857 search results - page 118 / 372
» Minimum Degree Orderings
Sort
View
WAW
2009
Springer
150views Algorithms» more  WAW 2009»
16 years 1 months ago
The Giant Component in a Random Subgraph of a Given Graph
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
Fan Chung Graham, Paul Horn, Linyuan Lu
COCO
2003
Springer
91views Algorithms» more  COCO 2003»
15 years 11 months ago
Extremal properties of polynomial threshold functions
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
Ryan O'Donnell, Rocco A. Servedio
AINA
2010
IEEE
15 years 11 months ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli
GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
15 years 10 months ago
Deceptiveness and neutrality the ND family of fitness landscapes
When a considerable number of mutations have no effects on fitness values, the fitness landscape is said neutral. In order to study the interplay between neutrality, which exists ...
William Beaudoin, Sébastien Vérel, P...
GLOBECOM
2010
IEEE
15 years 4 months ago
Providing Secrecy Irrespective of Eavesdropper's Channel State
A usual concern against physical layer security is that the legitimate parties would need to have (partial) channel state information (CSI) of the eavesdropper in order to design t...
Xiang He, Aylin Yener