Search results for "Cuts"

Hits ?▲	Authors	Title	Venue	Year	Link
12	Matthew Amodio, Feng Gao, Arman Avesta, Sanjay Aneja, Lucian V. Del Priore, Jay Wang, Smita Krishnaswamy	CUTS: A Fully Unsupervised Framework for Medical Image Segmentation.	CoRR	2022	DBLP DOI BibTeX RDF
12	Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu	Maintaining Expander Decompositions via Sparse Cuts.	CoRR	2022	DBLP DOI BibTeX RDF
12	Elisabeth Gaar, Jon Lee 0001, Ivana Ljubic, Markus Sinnl, Kübra Taninmis	On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.	CoRR	2022	DBLP DOI BibTeX RDF
12	Boris Chen, Amir Ziai, Rebecca S. Tucker, Yuchen Xie	Match Cutting: Finding Cuts with Smooth Visual Transitions.	CoRR	2022	DBLP DOI BibTeX RDF
12	Aurélien Naldi, Adrien Richard, Elisa Tonello	Linear cuts in Boolean networks.	CoRR	2022	DBLP DOI BibTeX RDF
12	Nanao Kita	Tight Cuts in Biartite Grafts I: Capital Distance Components.	CoRR	2022	DBLP BibTeX RDF
12	Wei-Chang Yeh	Novel Node-Based BAT for Finding All Minimal Cuts.	CoRR	2022	DBLP DOI BibTeX RDF
12	Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.	CoRR	2022	DBLP BibTeX RDF
12	Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang 0002	Approximate minimum cuts and their enumeration.	CoRR	2022	DBLP DOI BibTeX RDF
12	Yu Zhu 0003, Santiago Segarra	Hypergraph Cuts with Edge-Dependent Vertex Weights.	CoRR	2022	DBLP BibTeX RDF
12	Farshad Noravesh	Finding Many Sparse Cuts Using Entropy Maximization.	CoRR	2022	DBLP DOI BibTeX RDF
12	Li Chen 0028, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva	A Simple Framework for Finding Balanced Sparse Cuts via APSP.	CoRR	2022	DBLP DOI BibTeX RDF
12		Solving Routing Problems via Important Cuts.	CoRR	2022	DBLP BibTeX RDF
12	Anand Louis, Rameesh Paul, Arka Ray	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes.	CoRR	2022	DBLP DOI BibTeX RDF
12	Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak	Computational Short Cuts in Infinite Domain Constraint Satisfaction.	CoRR	2022	DBLP DOI BibTeX RDF
12	Gökhan Ceyhan, Murat Köksalan, Banu Lokman	Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently.	Eur. J. Oper. Res.	2022	DBLP DOI BibTeX RDF
12	Sunil Morapitiye, Tamás Kis	Strong cuts from compatibility relations for the Dial-a-Ride Problem.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
12	Chenglu Zhu, Xiaoyan Wang 0007, Shengyong Chen, Zhongzhao Teng, Cong Bai, Xiaojie Huang, Ming Xia, Zhanpeng Shao, Zheng Gu, Peiliang Sun	Complex carotid artery segmentation in multi-contrast MR sequences by improved optimal surface graph cuts based on flow line learning.	Medical Biol. Eng. Comput.	2022	DBLP DOI BibTeX RDF
12	Visnja Ognjenovic, Vladimir Brtka, Jelena Stojanov, Eleonora Brtka, Ivana Berkovic	The Cuts Selection Method Based on Histogram Segmentation and Impact on Discretization Algorithms.	Entropy	2022	DBLP DOI BibTeX RDF
12	Kejia Zhuang, Shengqiang Zhou, Lingli Zou, Liangliang Lin, Yang Liu, Jian Weng 0008, Jinqiang Gao	Numerical investigation of sequential cuts residual stress considering tool edge radius in machining of AISI 304 stainless steel.	Simul. Model. Pract. Theory	2022	DBLP DOI BibTeX RDF
12	Zhengyu Guo, Dongdong Jia, Gengsheng Zhang	Minimum arc-cuts of normally regular digraphs and Deza digraphs.	Discret. Math.	2022	DBLP DOI BibTeX RDF
12	Pauline Morin, Antoine Muller, Charles Pontonnier, Georges Dumont	Evaluation of the Foot Center of Pressure Estimation from Pressure Insoles during Sidestep Cuts, Runs and Walks.	Sensors	2022	DBLP DOI BibTeX RDF
12	Jacques D. Fleuriot, Lawrence C. Paulson	Constructing the Reals as Dedekind Cuts of Rationals.	Arch. Formal Proofs	2022	DBLP BibTeX RDF
12	Zuzana Patáková, Martin Tancer, Uli Wagner 0001	Barycentric Cuts Through a Convex Body.	Discret. Comput. Geom.	2022	DBLP DOI BibTeX RDF
12	Yu Zhu 0003, Santiago Segarra	Hypergraph cuts with edge-dependent vertex weights.	Appl. Netw. Sci.	2022	DBLP DOI BibTeX RDF
12	Mark Velednitsky	Solving (k-1)-stable instances of k-terminal cut with isolating cuts.	J. Comb. Optim.	2022	DBLP DOI BibTeX RDF
12	Marina Marceta, Tibor Lukic	Regularized graph cuts based discrete tomography reconstruction methods.	J. Comb. Optim.	2022	DBLP DOI BibTeX RDF
12	Mark Velednitsky	Correction To: Solving (k-1)-stable instances of k-terminal cut with isolating cuts.	J. Comb. Optim.	2022	DBLP DOI BibTeX RDF
12	Dedy Rahman Wijaya	Dataset for electronic nose from various beef cuts.		2022	DOI RDF
12	Felicia Lucke, Daniël Paulusma, Bernard Ries	Finding Matching Cuts in H-Free Graphs.	ISAAC	2022	DBLP DOI BibTeX RDF
12	Elisabeth Gaar, Jon Lee 0001, Ivana Ljubic, Markus Sinnl, Kübra Taninmis	SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs.	IPCO	2022	DBLP DOI BibTeX RDF
12	Rui Chen, James R. Luedtke	Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables.	IPCO	2022	DBLP DOI BibTeX RDF
12	Ruoxu Cen, Jason Li 0006, Debmalya Panigrahi	Augmenting Edge Connectivity via Isolating Cuts.	SODA	2022	DBLP DOI BibTeX RDF
12	Surender Baswana, Koustav Bhanja, Abhyuday Pandey	Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle.	ICALP	2022	DBLP DOI BibTeX RDF
12	Alvaro Arroyo, Bruno Scalzo, Ljubisa Stankovic, Danilo P. Mandic	Dynamic Portfolio Cuts: A Spectral Approach to Graph-Theoretic Diversification.	ICASSP	2022	DBLP DOI BibTeX RDF
12	Merav Parter, Asaf Petruschka	Near-Optimal Distributed Computation of Small Vertex Cuts.	DISC	2022	DBLP DOI BibTeX RDF
12	Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.	WG	2022	DBLP DOI BibTeX RDF
12	Nicolas Boutry, Gilles Bertrand 0001, Laurent Najman	Gradient Vector Fields of Discrete Morse Functions and Watershed-Cuts.	DGMM	2022	DBLP DOI BibTeX RDF
12	Michael H. F. Wilkinson	Component-Tree Simplification Through Fast Alpha Cuts.	DGMM	2022	DBLP DOI BibTeX RDF
12	Ian Shillito, Rajeev Goré	Direct elimination of additive-cuts in GL4ip: verified and extracted.	AiML	2022	DBLP BibTeX RDF
12	Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza	Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs.	IWOCA	2022	DBLP DOI BibTeX RDF
12	Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias	Sorting by k-Cuts on Signed Permutations.	RECOMB-CG	2022	DBLP DOI BibTeX RDF
12	Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik	Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts.	NeurIPS	2022	DBLP BibTeX RDF
12	Jian Gao, Yunfei Guo, Shuohang Yang, Zhongchang Sun	Phase Unwrapping Method Based on Branch-Cuts of Region Residues.	IGARSS	2022	DBLP DOI BibTeX RDF
12	Dongwon Ryu, Ehsan Shareghi, Meng Fang, Yunqiu Xu, Shirui Pan, Reza Haf	Fire Burns, Sword Cuts: Commonsense Inductive Bias for Exploration in Text-based Games.	ACL (2)	2022	DBLP DOI BibTeX RDF
12	Guantao Chen, Xing Feng, Fuliang Lu, Cláudio Leonardo Lucchesi, Lianzhu Zhang	Laminar tight cuts in matching covered graphs.	J. Comb. Theory, Ser. B	2021	DBLP DOI BibTeX RDF
12	Karen I. Aardal, Andrea Lodi 0001, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey	Lattice Reformulation Cuts.	SIAM J. Optim.	2021	DBLP DOI BibTeX RDF
12	Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang	Split Cuts in the Plane.	SIAM J. Optim.	2021	DBLP DOI BibTeX RDF
12	Christoph Neumann 0002, Oliver Stein	Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts.	SIAM J. Optim.	2021	DBLP DOI BibTeX RDF
12	Vincent Guigues, Renato D. C. Monteiro, Benar Fux Svaiter	Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems.	SIAM J. Optim.	2021	DBLP DOI BibTeX RDF
12	Chao Li 0051, Muhong Zhang, Kory W. Hedman	Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty.	INFORMS J. Comput.	2021	DBLP DOI BibTeX RDF
12	Álinson S. Xavier, Ricardo Fukasawa, Laurent Poirrier	Multirow Intersection Cuts Based on the Infinity Norm.	INFORMS J. Comput.	2021	DBLP DOI BibTeX RDF
12	Muhammad Touqeer, Rimsha Umer, Ali Ahmadian, Soheil Salahshour	A novel extension of TOPSIS with interval type-2 trapezoidal neutrosophic numbers using (α, β, γ)-cuts.	RAIRO Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Yiqing Zhao, Fei Cheng, Serhat Yüksel, Hasan Dinçer	Integer Code Series Enhanced IT2 Fuzzy Decision Support System With Alpha Cuts for the Innovation Adoption Life Cycle Pattern Recognition of Renewable Energy Alternatives.	IEEE Access	2021	DBLP DOI BibTeX RDF
12	Mingchun Li, Dali Chen, Shixin Liu, Fang Liu	Prior Mask R-CNN Based on Graph Cuts Loss and Size Input for Precipitation Measurement.	IEEE Trans. Instrum. Meas.	2021	DBLP DOI BibTeX RDF
12	Xiao Zhao, Sheng Chen	A note on tight cuts in matching-covered graphs.	Discret. Math. Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
12	Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz	Smaller Cuts, Higher Lower Bounds.	ACM Trans. Algorithms	2021	DBLP DOI BibTeX RDF
12	G. N. Balaji, S. Venkata Suryanarayana, Sengathir Janakiraman	Enhanced Boykov's graph cuts based segmentation for Cervical Cancer Detection.	EAI Endorsed Trans. Pervasive Health Technol.	2021	DBLP DOI BibTeX RDF
12	Franco Peschiera, Robert Dell, Johannes O. Royset, Alain Haït, Nicolas Dupin, Olga Battaïa	A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem.	OR Spectr.	2021	DBLP DOI BibTeX RDF
12	Burkhard Schafer 0001	Death by a Thousand Cuts: Cumulative Data Effects and the Corbyn Affair.	Datenschutz und Datensicherheit	2021	DBLP DOI BibTeX RDF
12	Sergio Cabello, Wolfgang Mulzer	Minimum cuts in geometric intersection graphs.	Comput. Geom.	2021	DBLP DOI BibTeX RDF
12	Guilherme de C. M. Gomes, Ignasi Sau	Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization.	Algorithmica	2021	DBLP DOI BibTeX RDF
12	Yanhong She, Zhuojun Zhao, Mengting Hu, Wen-Li Zheng, Xiaoli He	On selection of optimal cuts in complete multi-scale decision tables.	Artif. Intell. Rev.	2021	DBLP DOI BibTeX RDF
12	Thiago Alcântara Luiz, Haroldo Gambini Santos, Eduardo Uchoa	Cover by disjoint cliques cuts for the knapsack problem with conflicting items.	Oper. Res. Lett.	2021	DBLP DOI BibTeX RDF
12	Thomas Lange	Representing non-crossing cuts by phylogenetic trees.	Electron. J. Graph Theory Appl.	2021	DBLP DOI BibTeX RDF
12	Belén Masiá, Javier Camon, Diego Gutierrez, Ana Serrano	Influence of Directional Sound Cues on Users' Exploration Across 360° Movie Cuts.	IEEE Computer Graphics and Applications	2021	DBLP DOI BibTeX RDF
12	Manish Bansal, Yingqiu Zhang	Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs.	J. Glob. Optim.	2021	DBLP DOI BibTeX RDF
12	Daniel Anderson, Guy E. Blelloch	Parallel Minimum Cuts in O(m log2(n)) Work and Low Depth.	CoRR	2021	DBLP BibTeX RDF
12	Clément Rambour, Loïc Denis, Florence Tupin, Hélène Oriot, Yue Huang 0002, Laurent Ferro-Famil	Urban Surface Reconstruction in SAR Tomography by Graph-Cuts.	CoRR	2021	DBLP BibTeX RDF
12	Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak	A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs.	CoRR	2021	DBLP BibTeX RDF
12	Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer	Preventing Small (s, t)-Cuts by Protecting Edges.	CoRR	2021	DBLP BibTeX RDF
12	Ulrich Bauer, Abhishek Rathod, Meirav Zehavi	The complexity of high-dimensional cuts.	CoRR	2021	DBLP BibTeX RDF
12	Ruoxu Cen, Jason Li 0006, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak	Minimum Cuts in Directed Graphs via √n Max-Flows.	CoRR	2021	DBLP BibTeX RDF
12	Ruoxu Cen, Jason Li 0006, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak	Minimum Cuts in Directed Graphs via Partial Sparsification.	CoRR	2021	DBLP BibTeX RDF
12	Seth Pettie, Longhui Yin	The Structure of Minimum Vertex Cuts.	CoRR	2021	DBLP BibTeX RDF
12	Andrés López-Martínez, Sagnik Mukhopadhyay, Danupon Nanongkai	Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs.	CoRR	2021	DBLP BibTeX RDF
12	Zeren Huang, Kerong Wang, Furui Liu, Hui-Ling Zhen, Weinan Zhang 0001, Mingxuan Yuan, Jianye Hao, Yong Yu 0001, Jun Wang 0012	Learning to Select Cuts for Efficient Mixed-Integer Programming.	CoRR	2021	DBLP BibTeX RDF
12	Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, Jonathan Shi	Limitations of Local Quantum Algorithms on Maximum Cuts of Sparse Hypergraphs and Beyond.	CoRR	2021	DBLP BibTeX RDF
12	Elisabeth Gaar, Jon Lee 0001, Ivana Ljubic, Markus Sinnl, Kübra Taninmis	SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs.	CoRR	2021	DBLP BibTeX RDF
12	William Maxwell, Amir Nayyeri	Generalized max-flows and min-cuts in simplicial complexes.	CoRR	2021	DBLP BibTeX RDF
12	Ruoxu Cen, Jason Li 0006, Debmalya Panigrahi	Augmenting Edge Connectivity via Isolating Cuts.	CoRR	2021	DBLP BibTeX RDF
12	Chandra Chekuri, Kent Quanrud	Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems.	CoRR	2021	DBLP BibTeX RDF
12	Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak	Fast Algorithms for Hop-Constrained Flows and Moving Cuts.	CoRR	2021	DBLP BibTeX RDF
12	Jongeun Kim, Sven Leyffer, Prasanna Balaprakash	Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics.	CoRR	2021	DBLP BibTeX RDF
12	On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup	Compact cactus representations of all non-trivial min-cuts.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
12	Daniela Gaul, Daniel R. Schmidt	Chvátal-Gomory cuts for the Steiner tree problem.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
12	Barbara Geissmann, Lukas Gianinazzi	Parallel Minimum Cuts in Near-linear Work and Low Depth.	ACM Trans. Parallel Comput.	2021	DBLP DOI BibTeX RDF
12	Marco E. Lübbecke, Stephen J. Maher, Jonas T. Witt	Avoiding redundant columns by adding classical Benders cuts to column generation subproblems.	Discret. Optim.	2021	DBLP DOI BibTeX RDF
12	Zhen Yang, Yu-qian Zhao, Miao Liao, Shuan-hu Di, Ye-zhan Zeng	Semi-automatic liver tumor segmentation with adaptive region growing and graph cuts.	Biomed. Signal Process. Control.	2021	DBLP DOI BibTeX RDF
12	Antonios Gkortzis, Daniel Feitosa, Diomidis Spinellis	Software reuse cuts both ways: An empirical analysis of its relationship with security vulnerabilities.	J. Syst. Softw.	2021	DBLP DOI BibTeX RDF
12	Bowen Liu, Zhaoying Liu, Yujian Li, Ting Zhang, Zhilin Zhang	Iterative Min Cut Clustering Based on Graph Cuts.	Sensors	2021	DBLP DOI BibTeX RDF
12	Franco Parlamento, Flavio Previale	The Elimination of Atomic Cuts and the Semishortening Property for Gentzen's Sequent Calculus with Equality.	Rev. Symb. Log.	2021	DBLP DOI BibTeX RDF
12	Juan Carlos Figueroa-García, Christian Alfredo Varón-Gaviria, José Luis Barbosa-Fontecha	Fuzzy Random Variable Generation Using $\alpha$-Cuts.	IEEE Trans. Fuzzy Syst.	2021	DBLP DOI BibTeX RDF
12	Yuta Abe, Takaaki Mizuki, Hideaki Sone	Committed-format AND protocol using only random cuts.	Nat. Comput.	2021	DBLP DOI BibTeX RDF
12	Mirjana Borisavljevic	The subformula property of natural deduction derivations and analytic cuts.	Log. J. IGPL	2021	DBLP DOI BibTeX RDF
12	Zekeriya Uykan	Shadow-Cuts Minimization/Maximization and Complex Hopfield Neural Networks.	IEEE Trans. Neural Networks Learn. Syst.	2021	DBLP DOI BibTeX RDF
12	Emil Karlsson, Elina Rönnberg	Strengthening of Feasibility Cuts in Logic-Based Benders Decomposition.	CPAIOR	2021	DBLP DOI BibTeX RDF
12	Takao Asano	Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts.	ISAAC	2021	DBLP DOI BibTeX RDF
12	Anubhav Srivastava, Devendra Mishra, Madhuri Annavazzala, A. Antony Franklin, Nixon Patel, M. V. Panduranga Rao	Short-cuts on quantum network simulators.	ANTS	2021	DBLP DOI BibTeX RDF
12	Hiroto Koyama, Kodai Toyoda, Daiki Miyahara, Takaaki Mizuki	New Card-based Copy Protocols Using Only Random Cuts.	APKC@AsiaCCS	2021	DBLP DOI BibTeX RDF