1972 search results - page 98 / 395 » connection 2008 |
99
Voted
NETWORKING
2008
15 years 2 months ago
2008
The presence of Network Address Translation (NAT) is a hindrance when accessing services within home networks, because NAT breaks the end-to-end connectivity model of the Internet ...
106
Voted
IJON
2008
15 years 23 days ago
2008
The dynamical behavior and the stability properties of fixed points in a feedback auto-associative memory are investigated. The proposed structure encompasses a multi-layer percep...
119
click to vote
SIAMDM
2010
14 years 11 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
97
Voted
DM
2008
15 years 25 days ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
121
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...