Filters








58,128 Hits in 2.8 sec

Lazy Generic Cuts

Dinesh Khandelwal, Kush Bhatia, Chetan Arora, Parag Singla
2016 Computer Vision and Image Understanding  
In this paper, we propose a lazy version of Generic Cuts exploiting the property that in most of such inference problems a large fraction of the constraints are never used during the course of minimization  ...  Generic Cuts (GC) (Arora et al., 2015) combines the two approaches to generalize the traditional max-flow min-cut based algorithms for binary models with higher order clique potentials.  ...  Algorithm 1 1 Lazy Generic Cuts Algorithm.  ... 
doi:10.1016/j.cviu.2015.10.016 fatcat:5lqpqvgfgjhjvbt26srl6ug7la

Linear Additives [article]

Gianluca Curzi
2021 arXiv   pre-print
Moreover, a mildly weakened version of cut-elimination for this system is proven which takes a cubic number of steps.  ...  They never eliminate instances of cut like (17) and (18) , so that cutelimination fails in general.  ...  Generally speaking, we can represent a ∀-lazy cut-elimination strategy as: D = D 0 * cc 0 D ′ 0 src 0 D 1 · · · * cc i D ′ i src i D i+1 * cc i+1 · · · D ′ n−1 src n−1 D n * cc n D ′ n = D * (20) where  ... 
arXiv:2104.13739v1 fatcat:uash2cplnveehdgkseulbrvdtm

Guided lazy snapping for long thin object selection

Nam H. Tran, Dongsun Seo, Henry T.H. Tu, Nader Asnafi
2018 MATEC Web of Conferences  
Based on this observation, our Guided Lazy Snapping method overcomes the limitation of the Lazy Snapping methods (or other alternatives superpixel-based segmentation method) to select long thin objects  ...  Lazy Snapping [2] to cut out the object from the background.  ...  The reason is the ability to control over the size where the number of generated superpixel is the key to determine the Graph Cut performance.  ... 
doi:10.1051/matecconf/201818910026 fatcat:en6ore4zufhujn63ptttumioyq

Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving [chapter]

Peter J. Stuckey
2010 Lecture Notes in Computer Science  
Lazy clause generation is a hybrid of CP and SAT solving that combines the strengths of the two approaches.  ...  In this invited talk we explain lazy clause generation, and explore some of the many design choices in building such a hybrid system, we also discuss how to further incorporate mixed integer programming  ...  Lazy Clause Generation by Example The core of lazy clause generation is fairly straightforward to explain.  ... 
doi:10.1007/978-3-642-13520-0_3 fatcat:bwlxjkj54vfwxhoqmtnd4i3hmy

An efficient solver for weighted Max-SAT

Teresa Alsinet, Felip Manyà, Jordi Planes
2007 Journal of Global Optimization  
We present a new branch and bound algorithm for weighted Max-SAT, called 1 Lazy which incorporates original data structures and inference rules, as well as a lower 2 bound of better quality.  ...  CBC: It is an open source branch and cut MIP solver developed within the COIN-OR 237 project. 3 We used version 1.1.0. 238 As benchmarks we used randomly generated (weighted) Max-2-SAT and (weighted) Max  ...  ) Weighted Max-Cut (p hat) 12 528.4(3) 146.1(8) 9.7(8) 90.1(6) 287.2(12) 139.5(12) Weighted Max-Cut (san) 11 (0) 742.8(2) 1,238.3(6) 952.5(2) 543.1(9) 496.4(10) Weighted Max-Cut (sanr)  ... 
doi:10.1007/s10898-007-9166-9 fatcat:lk6fbxowgbgkdcrdexiqn5wkku

Lazy Systematic Unit Testing: JWalk versus JUnit

Anthony J H Simons, Christopher D Thomson
2007 Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (TAICPART-MUTATION 2007)  
This is based on lazy specification, inferring a continuously changing specification from rapidly evolving code, by dynamic code analysis and programmer interaction, and systematic testing, generating  ...  J Walk is a lazy systematic unit testing tool [1] .  ... 
doi:10.1109/taic.part.2007.14 fatcat:kfmpzbdadbda3p2dwqtcxjq6sa

Lazy Systematic Unit Testing: JWalk versus JUnit

Anthony J H Simons, Christopher D Thomson
2007 Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (TAICPART-MUTATION 2007)  
This is based on lazy specification, inferring a continuously changing specification from rapidly evolving code, by dynamic code analysis and programmer interaction, and systematic testing, generating  ...  J Walk is a lazy systematic unit testing tool [1] .  ... 
doi:10.1109/taicpart.2007.4344113 fatcat:3hopel5rcfanzb75tr33a77ske

A demand driven computation strategy for lazy narrowing [chapter]

Rita Loogen, Francisco López Fraguas, Mario Rodríguez Artalejo
1993 Lecture Notes in Computer Science  
This paper speci es a computation strategy for lazy conditional narrowing, based on the idea of transforming patterns into decision trees to control the computation.  ...  Lastly, in the following call pattern no variable position is demanded: cut(N; XjXs]). Note that this is a variant of (actually identical to) the lhs of rules CUT 2 and CUT 3 .  ...  The dt of cut is also uniform, but it looks a bit di erently. It includes a representation of the alternative between rules CUT 2 and CUT 3 , whose lhs are variants (identical, in fact): !  ... 
doi:10.1007/3-540-57186-8_79 fatcat:hawauho3uzdefhzqef72w3r2mq

T-Ω Formulation with Higher-Order Hierarchical Basis Functions for Nonsimply Connected Conductors

Ahmed Khebir, Paweł Dłotko, Bernard Kapidani, Ammar Kouki, Ruben Specogna
2018 Mathematical Problems in Engineering  
The novel idea of lazy cohomology generators [4] is exactly that all boundary generators produce a cut, even if half of them may be eliminated.  ...  The output of the ESTT restricted to K forms the required lazy cohomology generators.  ... 
doi:10.1155/2018/8308643 fatcat:dh4p7bv5hnhkvf4z53eau6gofe

T-Ω formulation with higher order hierarchical basis functions for non simply connected conductors

Ahmed Khebir, Pawel Dlotko, Bernard Kapidani, Ammar Kouki, Ruben Specogna
2016 2016 IEEE Conference on Electromagnetic Field Computation (CEFC)  
The novel idea of lazy cohomology generators [4] is exactly that all boundary generators produce a cut, even if half of them may be eliminated.  ...  The output of the ESTT restricted to K forms the required lazy cohomology generators.  ... 
doi:10.1109/cefc.2016.7816343 fatcat:jasjpoceenf2dckj4dbsodakhy

A type-assignment of linear erasure and duplication [article]

Gianluca Curzi, Luca Roversi
2020 arXiv   pre-print
LEM enjoys both a mildly weakened cut-elimination, whose computational cost is cubic, and Subject reduction.  ...  Lemma 13 (Eliminating a lazy cut). Let D be a lazy derivation with only exponential cuts in it. A lazy derivation D * exists such that both D ↝ D * , by reducing a lazy cut, and D * < D . Proof.  ...  Theorem 14 (Lazy cut-elimination has a cubic bound). Let D be a lazy derivation. The lazy cut-elimination can reduce D to a cut-free D * in O( D 3 ) steps. Proof.  ... 
arXiv:1912.12837v2 fatcat:j2lcqxklqbehlkfew27gpp2iey

Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor [article]

Prosenjit Bose and Jean-Lou De Carufel and Thomas Shermer
2022 arXiv   pre-print
Our results on lazy zombies still hold when an adversary chooses the initial positions of the zombies.  ...  Let z_L(G) be the smallest number of lazy zombies (zombies that can stay still on their turn) required to catch the survivor on a graph G.  ...  We will study general treewidth-k graphs in Section 5.  ... 
arXiv:2204.11926v1 fatcat:2ikctbsfsvd7zmeeauz5qyedpm

Lazy snapping

Yin Li, Jian Sun, Chi-Keung Tang, Heung-Yeung Shum
2004 ACM Transactions on Graphics  
In (d), the cut out is composed on another Van Gogh painting. Abstract In this paper, we present Lazy Snapping, an interactive image cutout tool.  ...  Instant feedback is made possible by a novel image segmentation algorithm which combines graph cut with pre-computed over-segmentation.  ...  It is therefore critical that our system generates the cutout boundary with very little delay.  ... 
doi:10.1145/1015706.1015719 fatcat:y4w67ugicfdblgexhq7cb46upa

Lazy snapping

Yin Li, Jian Sun, Chi-Keung Tang, Heung-Yeung Shum
2004 ACM SIGGRAPH 2004 Papers on - SIGGRAPH '04  
In (d), the cut out is composed on another Van Gogh painting. Abstract In this paper, we present Lazy Snapping, an interactive image cutout tool.  ...  Instant feedback is made possible by a novel image segmentation algorithm which combines graph cut with pre-computed over-segmentation.  ...  It is therefore critical that our system generates the cutout boundary with very little delay.  ... 
doi:10.1145/1186562.1015719 fatcat:66qu6lfujvafrfg6gmkvefxso4

Page 74 of International Journal of Plant Sciences Vol. 101, Issue 1 [page]

1939 International Journal of Plant Sciences  
In general these tests showed greater transport by lazy than by normal stems (table 1 and figure 3).  ...  For the combination type of test, sections 1 cm. long of growing zones were cut and clamped firmly in a horizontal position.  ... 
« Previous Showing results 1 — 15 out of 58,128 results