Search results for "$k$-Cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	José M. Bioucas-Dias, Gonçalo Valadão	Phase unwrapping: a new max-flow/min-cut based approach.	ICIP (2)	2005	DBLP DOI BibTeX RDF
19	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino	Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.	ISAAC	2005	DBLP DOI BibTeX RDF
19	Jun Yue, Wanjun Jin, Wenbin Chen 0006, I-Fan Shen	Efficient Texture Mapping Using Minimum Cut.	CIT	2005	DBLP DOI BibTeX RDF
19	Shengwu Xiong, Hongbing Liu, Xiaoxiao Niu	Fuzzy Support Vector Machines Based on lambda-Cut.	ICNC (1)	2005	DBLP DOI BibTeX RDF
19	Hong Song, Dan Zhang, Ji Liu	An Adaptive Hybrid Immune Genetic Algorithm for Maximum Cut Problem.	ICNC (2)	2005	DBLP DOI BibTeX RDF
19	Petros Drineas, Ravi Kannan, Michael W. Mahoney	Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms.	STACS	2005	DBLP DOI BibTeX RDF
19	M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserman	OBJ CUT.	CVPR (1)	2005	DBLP DOI BibTeX RDF
19	Daniel Freedman, Tao Zhang	Interactive Graph Cut Based Segmentation with Shape Priors.	CVPR (1)	2005	DBLP DOI BibTeX RDF	segmentation, level sets, graph cuts, shape priors
19	Alvaro Pardo	Simple and Robust Hard Cut Detection Using Interframe Differences.	CIARP	2005	DBLP DOI BibTeX RDF
19	Naoki Nitanda, Miki Haseyama, Hideo Kitajima	Audio signal segmentation and classification for scene-cut detection.	ISCAS (4)	2005	DBLP DOI BibTeX RDF
19	Payam Ghafari, Ehsan Mirhadi, Mohab Anis, Shawki Areibi, Mohamed I. Elmasry	A Low-Power Partitioning Methodology by Maximizing Sleep Time and Minimizing Cut Nets.	IWSOC	2005	DBLP DOI BibTeX RDF	Subthreshold Leakage Power, Sleep Time, Geometric Iterative Improvement, Genetic Algorithm, Partitioning, Segmented Trees
19	Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck	Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.	IPCO	2004	DBLP DOI BibTeX RDF
19	Andrew B. Kahng, Igor L. Markov, Sherief Reda	Boosting: Min-Cut Placement with Improved Signal Delay.	DATE	2004	DBLP DOI BibTeX RDF
19	Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell	Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?	FOCS	2004	DBLP DOI BibTeX RDF
19	Cruz Izu, Ramón Beivide	Understanding Buffer Management for Cut-Through 1D Rings.	Euro-Par	2004	DBLP DOI BibTeX RDF
19	Anthony D. Whitehead, Prosenjit Bose, Robert Laganière	Feature Based Cut Detection with Automatic Threshold Selection.	CIVR	2004	DBLP DOI BibTeX RDF
19	Jiangjian Xiao, Mubarak Shah	Motion Layer Extraction in the Presence of Occlusion Using Graph Cut.	CVPR (2)	2004	DBLP DOI BibTeX RDF
19	Ying Du, Danny Z. Chen, Xiaodong Wu 0001	Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study.	COCOON	2004	DBLP DOI BibTeX RDF
19	Noam Shental, Assaf Zomet, Tomer Hertz, Yair Weiss	Learning and Inferring Image Segmentations using the GBP Typical Cut Algorithm.	ICCV	2003	DBLP DOI BibTeX RDF
19	Yoshiyuki Furukawa, Hiroshi Masuda, Kenjiro T. Miura 0001, Hiroyuki Yamato	Cut-and-Paste Editing Based on Constrained B-spline Volume Fitting.	Computer Graphics International	2003	DBLP DOI BibTeX RDF
19	Paul S. Bonsma	The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.	WG	2003	DBLP DOI BibTeX RDF
19	Ameya R. Agnihotri, Mehmet Can Yildiz, Ateen Khatkhate, Ajita Mathur, Satoshi Ono, Patrick H. Madden	Fractional Cut: Improved Recursive Bisection Placement.	ICCAD	2003	DBLP DOI BibTeX RDF
19	Navaratnasothie Selvakkumaran, George Karypis	Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization.	ICCAD	2003	DBLP DOI BibTeX RDF	Maximum Subdomain Degree, Partitioning, Placement, Congestion
19	Gilles Dowek	Confluence as a Cut Elimination Property.	RTA	2003	DBLP DOI BibTeX RDF
19	Jeremy E. Dawson, Rajeev Goré	Formalised Cut Admissibility for Display Logic.	TPHOLs	2002	DBLP DOI BibTeX RDF
19	Qing Yang 0002, Bahram Parvin	Harmonic Cut and Regularized Centroid Transform for Localization of Subcellular Structures.	ICPR (1)	2002	DBLP DOI BibTeX RDF
19	Charles J. Alpert, Gi-Joon Nam, Paul Villarrubia	Free space management for cut-based placement.	ICCAD	2002	DBLP DOI BibTeX RDF
19	Sidnei Noceti Filho, Rui Seara	Cut-off frequencies in wide-band systems.	ISCAS (3)	2002	DBLP DOI BibTeX RDF
19	Wenwu Lou, Guimei Liu, Hongjun Lu, Qiang Yang 0001	Cut-and-Pick Transactions for Proxy Log Mining.	EDBT	2002	DBLP DOI BibTeX RDF
19	Birgit Elbl	Cut elimination for a calculus with context-dependent rules.	Arch. Math. Log.	2001	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03F05, 03B60, 68N17, 68Q55
19	Matthias Baaz, Alexander Leitsch	Comparing the Complexity of Cut-Elimination Methods.	Proof Theory in Computer Science	2001	DBLP DOI BibTeX RDF
19	Bertrand Guenin	Integral Polyhedra Related to Even Cycle and Even Cut Matroids.	IPCO	2001	DBLP DOI BibTeX RDF
19	François Margot	Pruning by Isomorphism in Branch-and-Cut.	IPCO	2001	DBLP DOI BibTeX RDF
19	Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail	101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem.	RECOMB	2001	DBLP DOI BibTeX RDF
19	Luís Torgo	A Study on End-Cut Preference in Least Squares Regression Trees.	EPIA	2001	DBLP DOI BibTeX RDF
19	Ching-Chih Han, Kang G. Shin, Sang Kyun Yun	On Load Balancing in Multicomputer/Distributed Systems Equipped with Circuit or Cut-Through Switching Capability.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	minimax flow problem, excess/deficit load, overloaded/underloaded nodes, link traffic, Load balancing
19	Ba Tu Truong, Chitra Dorai, Svetha Venkatesh	New enhancements to cut, fade, and dissolve detection processes in video segmentation.	ACM Multimedia	2000	DBLP DOI BibTeX RDF
19	Giovanni Motta, James A. Storer, Bruno Carpentieri	Improving Scene Cut Quality for Real-Time Video Decoding.	Data Compression Conference	2000	DBLP DOI BibTeX RDF	MPEG, H.263, Low Bit-Rate Video Coding
19	Alexander A. Ageev, Maxim Sviridenko	Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.	IPCO	1999	DBLP DOI BibTeX RDF
19	Andrea Clematis, Vittoria Gianuzzi	Extending PVM with Consistent Cut Capabilities: Application Aspects and Implementation Strategies.	PVM/MPI	1999	DBLP DOI BibTeX RDF
19	Wai-Kei Mak, D. F. Wong 0001	A fast hypergraph minimum cut algorithm.	ISCAS (6)	1999	DBLP DOI BibTeX RDF
19	Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud	Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	multicasting, Broadcasting, wormhole, circuit-switched networks
19	Wenceslas Fernandez de la Vega, Claire Kenyon	A Randomized Approximation Scheme for Metric MAX-CUT.	FOCS	1998	DBLP DOI BibTeX RDF
19	Bernhard Pflesser, Ulf Tiede, Karl Heinz Höhne	Specification, Modeling and Visualization of Arbitrarily Shaped Cut Surfaces in the Volume Model.	MICCAI	1998	DBLP DOI BibTeX RDF
19	David P. Williamson	Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture).	WG	1997	DBLP DOI BibTeX RDF
19	Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud	Broadcasting and Multicasting in Cut-through Routed Networks.	IPPS	1997	DBLP DOI BibTeX RDF
19	Wayne Citrin, Daniel Broodsky, Jeffrey D. McWhirter	Style-Based Cut-and-Paste in Graphical Editors.	Advanced Visual Interfaces	1994	DBLP DOI BibTeX RDF
19	Honghua Yang, D. F. Wong 0001	Efficient network flow based min-cut balanced partitioning.	ICCAD	1994	DBLP DOI BibTeX RDF
19	Lars W. Hagen, Andrew B. Kahng	New spectral methods for ratio cut partitioning and clustering.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1992	DBLP DOI BibTeX RDF
19	Burkhard Monien, Ivan Hal Sudborough	Min Cut is NP-Complete for Edge Weigthed Trees.	ICALP	1986	DBLP DOI BibTeX RDF
19	Yun Lu, Dejiang Zheng, Rong Su 0001, Avalpreet Singh Brar	Why Studying Cut-ins? Comparing Cut-ins and Other Lane Changes Based on Naturalistic Driving Data.	CoRR	2024	DBLP DOI BibTeX RDF
19	Patrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka	A branch-and-cut algorithm for the connected max-k-cut problem.	Eur. J. Oper. Res.	2024	DBLP DOI BibTeX RDF
19	Kyle Fox, Debmalya Panigrahi, Fred Zhang	Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions.	ACM Trans. Algorithms	2023	DBLP DOI BibTeX RDF
19	Sudhanshu Chanpuriya, Cameron Musco	Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More.	CoRR	2023	DBLP DOI BibTeX RDF
19	Yingjie Niu, Ming Ding 0002, Maoning Ge, Robin Karlsson, Yuxiao Zhang, Kazuya Takeda	R-Cut: Enhancing Explainability in Vision Transformers with Relationship Weighted Out and Cut.	CoRR	2023	DBLP DOI BibTeX RDF
19	Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick	Separating MAX 2-AND, MAX DI-CUT and MAX CUT.	FOCS	2023	DBLP DOI BibTeX RDF
19	Jia He Sun, Salimur Choudhury	Semi-supervised Learning Approach to Efficient Cut Selection in the Branch-and-Cut Framework.	ICCS (3)	2023	DBLP DOI BibTeX RDF
19	Wei Wei 0016, Qiuyuan Hu, Weidong Yang	Accelerate minimum cut calculation by tree-cut mapping with local pruning.	Adv. Eng. Softw.	2022	DBLP DOI BibTeX RDF
19	Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick	Separating MAX 2-AND, MAX DI-CUT and MAX CUT.	CoRR	2022	DBLP DOI BibTeX RDF
19	Matthew Johnson 0002, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen	Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs.	CoRR	2022	DBLP DOI BibTeX RDF
19	Orestis Plevrakis, Seyoon Ragavan, S. Matthew Weinberg	On the cut-query complexity of approximating max-cut.	CoRR	2022	DBLP DOI BibTeX RDF
19	Junlin Han, Pengfei Fang, Weihao Li, Jie Hong, Mohammad Ali Armin, Ian D. Reid 0001, Lars Petersson, Hongdong Li	You Only Cut Once: Boosting Data Augmentation with a Single Cut.	CoRR	2022	DBLP BibTeX RDF
19	Gintaras Palubeckis	Metaheuristic approaches for ratio cut and normalized cut graph partitioning.	Memetic Comput.	2022	DBLP DOI BibTeX RDF
19	Benedikt Wagner, Lucjan Hanzlik, Julian Loss	PI-Cut-Choo! Parallel Instance Cut and Choose for Practical Blind Signatures.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
19	Antares Chen, Jonathan Shi, Luca Trevisan	Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification.	SODA	2022	DBLP DOI BibTeX RDF
19	Hafsa Inam, Murtaza Najabat Ali, Faizan Javed	Design Development and Modeling of the Laser-Cut Reinforced Shaft for Radiopaque Media Delivery to Coronary Artery Using Finite Element Method: Laser cut catheter reinforced shaft.	ICBBB	2022	DBLP DOI BibTeX RDF
19	Rutchathon Chairattana-Apirom, Lucjan Hanzlik, Julian Loss, Anna Lysyanskaya, Benedikt Wagner	PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More.	CRYPTO (3)	2022	DBLP DOI BibTeX RDF
19	Junlin Han, Pengfei Fang, Weihao Li, Jie Hong, Mohammad Ali Armin, Ian D. Reid 0001, Lars Petersson, Hongdong Li	You Only Cut Once: Boosting Data Augmentation with a Single Cut.	ICML	2022	DBLP BibTeX RDF
19	Michelle Bandarra, Vincent Guigues	Single cut and multicut stochastic dual dynamic programming with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments.	Comput. Manag. Sci.	2021	DBLP DOI BibTeX RDF
19	Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang 0002	Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k.	CoRR	2021	DBLP BibTeX RDF
19	Manos N. Kamarianakis, Nick Lydatakis, Antonis Protopsaltis, John Petropoulos, Michail Tamiolakis, Paul Zikas, George Papagiannakis	"Deep Cut": An all-in-one Geometric Algorithm for Unconstrained Cut, Tear and Drill of Soft-bodies in Mobile VR.	CoRR	2021	DBLP BibTeX RDF
19	Wei Wei 0016, Xiaohui Gong, Weidong Yang, Yashuang Mu	Minimum Cut Acceleration by Exploiting Tree-Cut Injection for Upper Bound Estimation.	IEEE Commun. Lett.	2021	DBLP DOI BibTeX RDF
19	N. R. Aravind, Roopam Saxena	An FPT Algorithm for Matching Cut and d-Cut.	IWOCA	2021	DBLP DOI BibTeX RDF
19	Chenglong Wang, Masahiro Oda, Yuichiro Hayashi, Yasushi Yoshino, Tokunori Yamamoto, Alejandro F. Frangi, Kensaku Mori	Tensor-cut: A tensor-based graph-cut blood vessel segmentation method and its application to renal artery segmentation.	Medical Image Anal.	2020	DBLP DOI BibTeX RDF
19	Mohammad Hossein Basiri, Benyamin Ghojogh, Nasser L. Azad, Sebastian Fischmeister, Fakhri Karray, Mark Crowley 0001	Distributed Nonlinear Model Predictive Control and Metric Learning for Heterogeneous Vehicle Platooning with Cut-in/Cut-out Maneuvers.	CoRR	2020	DBLP BibTeX RDF
19	Amir Abboud, Robert Krauthgamer, Ohad Trabelsi	Cut-Equivalent Trees are Optimal for Min-Cut Queries.	CoRR	2020	DBLP BibTeX RDF
19	Amir Abboud, Robert Krauthgamer, Ohad Trabelsi	Cut-Equivalent Trees are Optimal for Min-Cut Queries.	FOCS	2020	DBLP DOI BibTeX RDF
19	Mohammad Hossein Basiri, Benyamin Ghojogh, Nasser L. Azad, Sebastian Fischmeister, Fakhri Karray, Mark Crowley 0001	Distributed Nonlinear Model Predictive Control and Metric Learning for Heterogeneous Vehicle Platooning with Cut-in/Cut-out Maneuvers.	CDC	2020	DBLP DOI BibTeX RDF
19	Sagnik Mukhopadhyay, Danupon Nanongkai	Weighted min-cut: sequential, cut-query, and streaming algorithms.	STOC	2020	DBLP DOI BibTeX RDF
19	Eden Chlamtác, Petr Kolman	How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut.	APPROX-RANDOM	2020	DBLP DOI BibTeX RDF
19	Amey Bhangale, Subhash Khot	Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut.	CCC	2020	DBLP DOI BibTeX RDF
19	Amey Bhangale, Subhash Khot	Simultaneous Max-Cut is harder to approximate than Max-Cut.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
19	Susanne Bobzien, Roy Dyckhoff	Analyticity, Balance and Non-admissibility of $$\varvec{Cut}$$ Cut in Stoic Logic.	Stud Logica	2019	DBLP DOI BibTeX RDF
19	Sagnik Mukhopadhyay, Danupon Nanongkai	Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms.	CoRR	2019	DBLP BibTeX RDF
19	Kyle Fox, Debmalya Panigrahi, Fred Zhang	Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions.	SODA	2019	DBLP DOI BibTeX RDF
19	Vladimira Ganchovska, Atanaska Bosakova-Ardenska, Peter Panayotov, Lena Kostadinova-Georgieva, Angel Danev, Ivanka Krasteva	Blue cheese cut surface evaluation by images analysis: Application of image processing for analysis the mold distribution on cut surface of blue cheese.	CompSysTech	2019	DBLP DOI BibTeX RDF
19	Richard Ramchurn, Sarah Martindale, Max L. Wilson 0001, Steve Benford	From Director's Cut to User's Cut: to Watch a Brain-Controlled Film is to Edit it.	CHI	2019	DBLP DOI BibTeX RDF
19	Mourad Baïou, Francisco Barahona	Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem.	Math. Program.	2018	DBLP DOI BibTeX RDF
19	Johannes G. G. Dobbe, Simon D. Strackee, Geert J. Streekstra	Minimizing the Translation Error in the Application of an Oblique Single-Cut Rotation Osteotomy: Where to Cut?	IEEE Trans. Biomed. Eng.	2018	DBLP DOI BibTeX RDF
19	Xiaoxin Li, Jia-Bao Liu	On the reciprocal degree distance of graphs with cut vertices or cut edges.	Ars Comb.	2017	DBLP BibTeX RDF
19	Vladimir A. Bondarenko, Andrei V. Nikolaev	On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems.	Int. J. Math. Math. Sci.	2016	DBLP DOI BibTeX RDF
19	Chongdeuk Lee, Gorden K. Lee	An Alpha Cut (α-cut) Filter-Based Proxy Caching Control for Wireless Coverage Streaming Services.	Wirel. Pers. Commun.	2016	DBLP DOI BibTeX RDF
19	Samuel G. Da Silva	Topological equivalences of CUT and CUT(Fin).	Arch. Math. Log.	2016	DBLP DOI BibTeX RDF
19	Mourad Baïou, Francisco Barahona	Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem.	IPCO	2016	DBLP DOI BibTeX RDF
19	Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha	Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem.	Networks	2015	DBLP DOI BibTeX RDF
19	Yi Peng 0002, Li Chen, Fang-Xin Ou-Yang, Wei Chen 0001, Jun-Hai Yong	JF-Cut: A Parallel Graph Cut Approach for Large-Scale Image and Video.	IEEE Trans. Image Process.	2015	DBLP DOI BibTeX RDF
19	Yu-Teng Chang, Dimitrios Pantazis, Richard M. Leahy	To cut or not to cut? Assessing the modular structure of brain networks.	NeuroImage	2014	DBLP DOI BibTeX RDF
19	Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan	Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut.	SODA	2014	DBLP DOI BibTeX RDF
19	Thorsten Beier, Thorben Kröger, Jörg H. Kappes, Ullrich Köthe, Fred A. Hamprecht	Cut, Glue, & Cut: A Fast, Approximate Solver for Multicut Partitioning.	CVPR	2014	DBLP DOI BibTeX RDF
19	Elaine Ayumi Chiba, Marco António Garcia de Carvalho, André Luis da Costa	Graph Cut and Image Segmentation using Mean Cut by Means of an Agglomerative Algorithm.	VISAPP (1)	2014	DBLP DOI BibTeX RDF