Sciweavers

96 search results - page 11 / 20
» Length-bounded cuts and flows
Sort
View
MICCAI
2007
Springer
14 years 8 months ago
Modelling Intravasation of Liquid Distension Media in Surgical Simulators
We simulate the intravasation of liquid distention media into the systemic circulation as it occurs during hysteroscopy and transurethral resection of the prostate. A linear networ...
Stefan Tuchschmid, Michael Bajka, Dominik Szczerba...
CC
2006
Springer
108views System Software» more  CC 2006»
13 years 11 months ago
A Fresh Look at PRE as a Maximum Flow Problem
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
Jingling Xue, Jens Knoop
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
14 years 7 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
ICASSP
2008
IEEE
14 years 1 months ago
Optical flow robust estimation in a hybrid multi-resolution MRF framework
We propose in this paper a robust multi-resolution technique to estimate dense velocity field from image sequences. It couples a Gaussian pyramidal down-sampling decomposition to...
Cyril Cassisa, Véronique Prinet, Liang Shao...
ANOR
2007
126views more  ANOR 2007»
13 years 7 months ago
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
Quentin Louveaux, Laurence A. Wolsey