IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference 2008
DOI: 10.1109/glocom.2008.ecp.456
|View full text |Cite
|
Sign up to set email alerts
|

On Robust Traffic Engineering in Transport Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0
2

Year Published

2009
2009
2021
2021

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 6 publications
0
17
0
2
Order By: Relevance
“…It is possible to replace these numerical methods by deriving an analytic model of the active contour and obtain analytic expressions for their gradients using symbolic computation. Specifically, we use Gaussian process regression (GPR) ( [10], [11]) to fit analytic functions oversubsets of original image and ExprLib ( [12], [13]) to do the update step of "Level Set Function" LSF by symbolic calculation of gradients. Furthermore, ExprLib has the capability to generate source code that represents these calculations.…”
Section: The Symbolic Active Contour Methodsmentioning
confidence: 99%
“…It is possible to replace these numerical methods by deriving an analytic model of the active contour and obtain analytic expressions for their gradients using symbolic computation. Specifically, we use Gaussian process regression (GPR) ( [10], [11]) to fit analytic functions oversubsets of original image and ExprLib ( [12], [13]) to do the update step of "Level Set Function" LSF by symbolic calculation of gradients. Furthermore, ExprLib has the capability to generate source code that represents these calculations.…”
Section: The Symbolic Active Contour Methodsmentioning
confidence: 99%
“…We use P (i|j) to show the truncated (n − 1) × (n − 1) matrix that results from removing i th row and j th column of matrix P . It is shown in [10] that:…”
Section: Network Modelmentioning
confidence: 99%
“…We are interested in quantifying the betweenness of a node in the random-walk corresponding to a Markov chain. The original definition of random-walk betweenness is given in [7], but here we use a modified version defined in [10]. Consider the set of trajectories that begin at node s and terminate when the walk first arrives at node d, that is, destination node d is an absorbing node.…”
Section: Network Modelmentioning
confidence: 99%
See 2 more Smart Citations