In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
This paper describes a random jitter measurement technique using simple algorithms and comparator sampling. The approach facilitates using Automated Test Equipment (ATE) to valida...