Sciweavers

982 search results - page 162 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
FOCS
1997
IEEE
14 years 2 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
STACS
2004
Springer
14 years 3 months ago
An Algorithmic View on OVSF Code Assignment
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
Thomas Erlebach, Riko Jacob, Matús Mihal&aa...
ANOR
2006
133views more  ANOR 2006»
13 years 10 months ago
Horizon and stages in applications of stochastic programming in finance
To solve a decision problem under uncertainty via stochastic programming means to choose or to build a suitable stochastic programming model taking into account the nature of the r...
Marida Bertocchi, Vittorio Moriggia, Jitka Dupacov...
IPPS
2003
IEEE
14 years 3 months ago
Master-slave Tasking on Heterogeneous Processors
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
Pierre-François Dutot
CVPR
2003
IEEE
15 years 2 days ago
Object-Specific Figure-Ground Segregation
We consider the problem of segmenting an image into foreground and background, with foreground containing solely objects of interest known a priori. We propose an integration mode...
Stella X. Yu, Jianbo Shi