9949 search results - page 120 / 1990 » On the Network Complexity of Selection |
134
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— NetFlow is a solution to make an in-depth traffic analysis possible in IP networks. Most of the telecommunication operators have already deployed it, or intend to do so, for n...
129
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
148
click to vote
ISNN
2010
Springer
15 years 9 months ago
2010
Springer
In this paper, we make some analysis on the FitzHugh-Nagumo model and improve it to build a neural network, and the network is used to implement visual selection and attention shif...
114
click to vote
ISAAC
1994
Springer
15 years 8 months ago
1994
Springer
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...
134
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Routing policies used in the Internet can be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid ro...