Sciweavers

4962 search results - page 81 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
152
Voted
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
15 years 10 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
142
Voted
ACSAC
2003
IEEE
15 years 10 months ago
Making Secure TCP Connections Resistant to Server Failures
Methods are presented to increase resiliency to server failures by migrating long running, secure TCP-based connections to backup servers, thus mitigating damage from servers disa...
Hailin Wu, Andrew Burt, Ramki Thurimella
JOCN
2011
78views more  JOCN 2011»
14 years 12 months ago
Changes in Cerebello-motor Connectivity during Procedural Learning by Actual Execution and Observation
■ The cerebellum is involved in motor learning of new procedures both during actual execution of a motor task and during observational training. These processes are thought to d...
Sara Torriero, Massimiliano Oliveri, Giacomo Koch,...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 5 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
ICASSP
2009
IEEE
15 years 11 months ago
Connecting spectral and spring methods for manifold learning
Diffusion Maps (DiffMaps) has recently provided a general framework that unites many other spectral manifold learning algorithms, including Laplacian Eigenmaps, and it has become ...
Shannon M. Hughes, Peter J. Ramadge