Sciweavers

1078 search results - page 10 / 216
» Networks with Small Stretch Number
Sort
View
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 8 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
INFOCOM
1994
IEEE
14 years 16 days ago
Scheduling Nonuniform Traffic in a Packet Switching System with Small Propagation Delay
A new model of nonuniform traffic is introduced for a single-hop packet-switching system. This traffic model allows arbitrary traffic streams subject only to a constraint on the nu...
Timothy Weller, Bruce Hajek
CSC
2009
13 years 9 months ago
Fast Monte Carlo Algorithms on Re-Wired Small-World Spin Models
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
Kenneth A. Hawick
HOTNETS
2010
13 years 3 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 1 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld