13214 search results - page 386 / 2643 » Pseudorandomness for network algorithms |
178
click to vote
COLOGNETWENTE
2008
15 years 8 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
206
click to vote
AIA
2006
15 years 8 months ago
2006
A system based on a neural network framework is considered. We used two neural networks, an Elman network [1][2] and a Kohonen (concurrent) network [3], for a categorization task....
178
click to vote
NETWORKS
2008
15 years 6 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
182
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...
173
click to vote
INFOCOM
2005
IEEE
16 years 13 days ago
2005
IEEE
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...