Sciweavers

112 search results - page 7 / 23
» A Ramsey-type result for the hypercube
Sort
View
EUROPDS
1997
13 years 8 months ago
A Highly Fault-Tolerant Circuit-Switched Hypercube
In this paper, we present a strongly fault-tolerant design for a d-dimensional hypercube multiprocessor and examine its reconfigurability. The augmented hypercube has a spare nod...
Baback A. Izadi, Füsun Özgüner, Adn...
FOCS
2002
IEEE
14 years 9 days ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
FSTTCS
1990
Springer
13 years 11 months ago
Randomized Parallel Selection
We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(N/P) with high probability, provided each node can process all the in...
Sanguthevar Rajasekaran
ENGL
2008
79views more  ENGL 2008»
13 years 7 months ago
The Hamiltonicity of Crossed Cubes in the Presence of Faults
The crossed cube is considered as one of the most promising variations of the hypercube topology, due to its ability of preserving many of the attractive properties of the hypercub...
Emad Abuelrub
EOR
2008
69views more  EOR 2008»
13 years 7 months ago
On the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
E. de Klerk, Dick den Hertog, G. Elabwabi