نتایج جستجو برای: st-cut

تعداد نتایج: 153546  

2010
Eric Vigoda

Traditionally, the min-cut problem was solved by solving n − 1 min-st-cut problems. In the min-st-cut problem we are given as input two vertices s and t, our aim is to find the set S where s ∈ S and t / ∈ S which minimizes the size of the cut (S, S), i.e., |δ(S)|. The size of the min-st-cut is equal to the value of the max-st-flow (equivalent by linear programming duality). The fastest algorith...

Journal: :ACM Transactions on Algorithms 2016

2018
Shay Mozes Kirill Nikolaev Yahav Nussbaum Oren Weimann

We give an O(n log log n) time algorithm for computing the minimum cut (or equivalently, the shortest cycle) of a weighted directed planar graph. This improves the previous fastest O(n log n) solution [SODA’04]. Interestingly, while in undirected planar graphs both min-cut and min st-cut have O(n log log n) solutions [ESA’11, STOC’11], in directed planar graphs our result makes min-cut faster t...

2016
Rajesh Hemant Chitnis Lior Kamma Robert Krauthgamer

By a classical result of Gomory and Hu (1961), in every edgeweighted graph G = (V,E,w), the minimum st-cut values, when ranging over all s, t ∈ V , take at most |V |−1 distinct values. That is, these (|V | 2 ) instances exhibit redundancy factor Ω(|V |). They further showed how to construct from G a tree (V,E′, w′) that stores all minimum st-cut values. Motivated by this result, we obtain tight...

Journal: :Circulation 1990
B Lachterman K G Lehmann R Detrano J Neutel V F Froelicher

The objective of our study was to compare the discriminating power of a proposed ST segment/heart rate index with that of a standard method of assessing exercise-induced ST segment depression for diagnosing coronary artery disease. We used a cross-sectional retrospective analysis of exercise test and coronary angiographic data. The study took place in a 1,200-bed Veterans Affairs Medical Center...

Journal: :Math. Program. 2007
Sylvia C. Boyd Sally Cockburn Danielle Vella

One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (ST SP) is the branch and cut method. This method requires knowledge of classes of useful valid inequalities for the polytope associated with the ST SP, as well as efficient separation routines for these classes of inequalities. Recent...

Journal: :European heart journal 2004
Erik Björklund Bertil Lindahl Per Johanson Tomas Jernberg Ann Marie Svensson Per Venge Lars Wallentin Mikael Dellborg

AIMS The prognostic value of admission troponin T (tnT) levels and the resolution of the ST-segment elevation in ST-elevation myocardial infarction (STEMI) is well established. However, the combination of these two early available markers for predicting risk has not been evaluated. METHODS AND RESULTS We evaluated 516 patients with fibrinolytic treated STEMI from the ASSENT-2 and ASSENT-PLUS ...

2017
Wei Li Yuanjun Guo Yongliang Tang Xiaotao Zu Jinyi Ma Lu Wang Yongqing Fu

Using a seed layer-free hydrothermal method, ZnO nanorods (NRs) were deposited on ST-cut quartz surface acoustic wave (SAW) devices for ammonia sensing at room temperature. For a comparison, a ZnO film layer with a thickness of 30 nm was also coated onto an ST-cut quartz SAW device using a sol-gel and spin-coating technique. The ammonia sensing results showed that the sensitivity, repeatability...

2012
Sarah Kozey-Keadle Amanda Libertine John Staudenmayer Patty Freedson

This study examined the feasibility of reducing free-living sedentary time (ST) and the convergent validity of various tools to measure ST. Twenty overweight/obese participants wore the activPAL (AP) (criterion measure) and ActiGraph (AG; 100 and 150 count/minute cut-points) for a 7-day baseline period. Next, they received a simple intervention targeting free-living ST reductions (7-day interve...

2010
Takeshi Matsuo Shinichi Nakajima

This note presents Nikon’s approach to the multimedia event detection (MED) task of TRECVID 2010. We explain the basic concept of our system which detects events by multiple keyframes extraction based on scene length. We describe the algorithm in detail and show experimental results with the MED dataset. Our simple system got the third place among seven teams of participants. 1 Basic Concept We...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید