Sciweavers

4962 search results - page 852 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
SODA
2000
ACM
102views Algorithms» more  SODA 2000»
15 years 7 months ago
Escaping a grid by edge-disjoint paths
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
WSS
1997
112views Control Systems» more  WSS 1997»
15 years 7 months ago
Propagated timestamps: a scheme for the stabilization of maximum-flow routing protocols
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
Jorge Arturo Cobb, Mohamed Waris
NIPS
1996
15 years 7 months ago
Early Brain Damage
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...
Volker Tresp, Ralph Neuneier, Hans-Georg Zimmerman...
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
15 years 7 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
SIGCOMM
2010
ACM
15 years 6 months ago
Experimenting with multipath TCP
It is becoming the norm for small mobile devices to have access to multiple technologies for connecting to the Internet. This gives researchers an increasing interest for solution...
Sébastien Barré, Olivier Bonaventure...