Sciweavers

4679 search results - page 77 / 936
» Modeling When Connections Are the Problem
Sort
View
INFOCOM
2002
IEEE
15 years 6 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
WIOPT
2006
IEEE
15 years 7 months ago
A general probabilistic model for improving key assignment in wireless networks
Abstract— We study the problem of establishing secure communication channels in resource-constrained wireless networks using key predistribution. Pairwise communication channels ...
Patrick Tague, Radha Poovendran
MICCAI
2009
Springer
16 years 2 months ago
Shape Modelling for Tract Selection
Abstract. Probabilistic tractography provides estimates of the probability of a structural connection between points or regions in a brain volume, based on information from diffusi...
Jonathan D. Clayden, Martin D. King, Chris A. Cl...
LATIN
2004
Springer
15 years 7 months ago
Combinatorial Problems on Strings with Applications to Protein Folding
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
Alantha Newman, Matthias Ruhl
PERCOM
2006
ACM
16 years 1 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece