Sciweavers

126 search results - page 7 / 26
» Centrality in Policy Network Drawings
Sort
View
GD
2006
Springer
13 years 11 months ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis
DAGSTUHL
2003
13 years 8 months ago
Policies: Giving Users Control over Calls
Abstract. Features provide extensions to a basic service, but in new systems users require much greater flexibility oriented towards their needs. Traditional features do not easil...
Stephan Reiff-Marganiec
SIGCOMM
2010
ACM
13 years 7 months ago
Scalable flow-based networking with DIFANE
Ideally, enterprise administrators could specify fine-grain policies that drive how the underlying switches forward, drop, and measure traffic. However, existing techniques for fl...
Minlan Yu, Jennifer Rexford, Michael J. Freedman, ...
FIW
2003
120views Communications» more  FIW 2003»
13 years 8 months ago
A Policy Architecture for Enhancing and Controlling Features
Abstract. Features provide extensions to a basic service, but in new systems users require much greater flexibility oriented towards their needs. Traditional features do not easil...
Stephan Reiff-Marganiec, Kenneth J. Turner
WISE
2002
Springer
14 years 11 days ago
An MDP-based Peer-to-Peer Search Server Network
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...
Yipeng Shen, Dik Lun Lee