Sciweavers

2283 search results - page 335 / 457
» Bounds of Graph Characteristics
Sort
View
BROADNETS
2005
IEEE
14 years 1 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
EMSOFT
2004
Springer
14 years 1 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
AII
1992
14 years 5 days ago
Learning from Multiple Sources of Inaccurate Data
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
Ganesh Baliga, Sanjay Jain, Arun Sharma
TON
2008
119views more  TON 2008»
13 years 8 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
ICCV
2009
IEEE
15 years 1 months ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
The concept of graph cuts is by now a standard method for all sorts of low level vision problems. Its popularity is largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...