Search results for "S-cuts"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
146	Jin-Tai Yan	An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering.	ICCD	1995	DBLP DOI BibTeX RDF	cut-based algorithm, L-shaped channels, safe routing ordering, geometrical topology, floorplan graph, channel precedence graph, S-cuts, redundant L-cuts, balanced L-cuts, non-minimal L-cuts, non-critical L-cuts, critical L-cuts, computational complexity, time complexity, circuit layout CAD, line segments, precedence relations
138	Satrajit Chatterjee, Alan Mishchenko, Robert K. Brayton	Factor cuts.	ICCAD	2006	DBLP DOI BibTeX RDF
81	Matteo Fischetti, Cristiano Saturni	Mixed-Integer Cuts from Cyclic Groups.	IPCO	2005	DBLP DOI BibTeX RDF	Subadditive cuts, Gomory cuts, Gyclic Group and Corner polyhedra, Mixed-Integer Programming
71	Mehmet Tolga Çezik, Garud Iyengar	Cuts for mixed 0-1 conic programming.	Math. Program.	2005	DBLP DOI BibTeX RDF
71	Yefim Dinitz	The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph.	WG	1992	DBLP DOI BibTeX RDF
69	Sanjeeb Dash, Oktay Günlük	On the strength of Gomory mixed-integer cuts as group cuts.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mixed integer rounding, Cyclic group polyhedra, Integer programming, Cutting planes
66	Matteo Fischetti, Cristiano Saturni	Mixed-Integer Cuts from Cyclic Groups.	Math. Program.	2007	DBLP DOI BibTeX RDF	Subadditive cuts, Gomory cuts, Corner polyhedra, Mixed-Integer Programming, Cyclic Group
65	Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka	Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts.	Algorithmica	2009	DBLP DOI BibTeX RDF	Chvátal-Gomory cuts, Separation algorithms, Integer programming
64	Vladimir Kolmogorov, Yuri Boykov	What Metrics Can Be Approximated by Geo-Cuts, Or Global Optimization of Length/Area and Flux.	ICCV	2005	DBLP DOI BibTeX RDF
59	Taiga Takata, Yusuke Matsunaga	An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs.	ACM Great Lakes Symposium on VLSI	2009	DBLP DOI BibTeX RDF	FPGA, logic synthesis, technology mapping
58	Charles Audet, Jean Haddad, Gilles Savard	Disjunctive cuts for continuous linear bilevel programming.	Optim. Lett.	2007	DBLP DOI BibTeX RDF	Linear bilevel programming, Disjunctive cuts, Global optimization
58	Anjin Park, Kwangjin Hong, Keechul Jung	Better Foreground Segmentation for 3D Face Reconstruction Using Graph Cuts.	PSIVT	2007	DBLP DOI BibTeX RDF	Shadow Elimination, 3D Face Reconstruction, Graph Cuts, Foreground Segmentation
57	Anjin Park, Jungwhan Kim, Seungki Min, Sungju Yun, Keechul Jung	Graph Cuts-Based Automatic Color Image Segmentation.	DICTA	2008	DBLP DOI BibTeX RDF
57	Vladimir Kolmogorov, Ramin Zabih	What Energy Functions Can Be Minimized via Graph Cuts?	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	optimization, Markov Random Fields, graph algorithms, Energy minimization, maximum flow, minimum cut
57	Alberto Caprara, Matteo Fischetti, Adam N. Letchford	On the Separation of Maximally Violated mod-k Cuts.	IPCO	1999	DBLP DOI BibTeX RDF
52	Frithjof Dau	An Embedding of Existential Graphs into Concept Graphs with Negations.	ICCS	2002	DBLP DOI BibTeX RDF
52	Jin-Tai Yan	An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1999	DBLP DOI BibTeX RDF
50	Lewis Ntaimo, Matthew W. Tanner	Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs.	J. Glob. Optim.	2008	DBLP DOI BibTeX RDF	Lift-and-project cuts, Integer programming, Stochastic programming, Disjunctive programming
49	Alper Atamtürk, Vishnu Narayanan	Conic mixed-integer rounding cuts.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C11, 90C25, 90C57
49	Yu Fu, Jian Cheng 0001, Zhenglong Li, Hanqing Lu	Saliency Cuts: An automatic approach to object segmentation.	ICPR	2008	DBLP DOI BibTeX RDF
49	Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka	Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts.	ESA	2007	DBLP DOI BibTeX RDF
49	Yuri Boykov, Gareth Funka-Lea	Graph Cuts and Efficient N-D Image Segmentation.	Int. J. Comput. Vis.	2006	DBLP DOI BibTeX RDF
49	Olivier Juan, Yuri Boykov	Active Graph Cuts.	CVPR (1)	2006	DBLP DOI BibTeX RDF
49	Herve Lombaert, Yiyong Sun, Leo J. Grady, Chenyang Xu 0001	A Multilevel Banded Graph Cuts Method for Fast Image Segmentation.	ICCV	2005	DBLP DOI BibTeX RDF
49	Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar	Short-Cuts on Star, Source and Planar Unfoldings.	FSTTCS	2004	DBLP DOI BibTeX RDF
49	Vladimir Kolmogorov, Ramin Zabih	What Energy Functions Can Be Minimized via Graph Cuts?	ECCV (3)	2002	DBLP DOI BibTeX RDF
49	Marcin Skubiszewski, Nicolas Porteix	Partly-Consistent Cuts of Databases.	Euro-Par	1997	DBLP DOI BibTeX RDF
49	Adam Dingle, Richard J. Fateman	Branch Cuts in Computer Algebra.	ISSAC	1994	DBLP DOI BibTeX RDF	Mathematica
47	Sanjiv Kapoor	On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees.	IPCO	1996	DBLP DOI BibTeX RDF
45	Pablo Rey, Claudia A. Sagastizábal	Convex Normalizations in Lift-and-Project Methods for 0-1 Programming.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	disjunctive cuts, 0-1 integer programming, Branch-and-Cut, cutting planes, Lift-and-Project
44	Gérard Cornuéjols	Valid inequalities for mixed integer linear programs.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C10, 90C57, 90C11
44	Ewen Cheslack-Postava, Rui Wang 0003, Oskar Åkerlund, Fabio Pellacini	Fast, realistic lighting and material design using nonlinear cut approximation.	ACM Trans. Graph.	2008	DBLP DOI BibTeX RDF
44	András A. Benczúr	A Representation of Cuts within 6/5 Times the Edge Connectivity with Applications.	FOCS	1995	DBLP DOI BibTeX RDF	edge connected graph, planar geometric representation, edge cuts, query structure, edge splitting, edge augmentation problem, computational complexity, data structures, computational geometry, cuts, edge connectivity
43	Mikkel Thorup	Minimum k-way cuts via deterministic greedy tree packing.	STOC	2008	DBLP DOI BibTeX RDF	k-way cuts, tree packing
43	Charalambos Poullis, Suya You, Ulrich Neumann	Linear feature extraction using perceptual grouping and graph-cuts.	GIS	2007	DBLP DOI BibTeX RDF	feature extraction, global optimization, graph-cuts, road network, perceptual grouping
43	Anesto del-Toro-Almenares, Cosmin Mihai, Iris Vanhamel, Hichem Sahli	Graph Cuts Approach to MRF Based Linear Feature Extraction in Satellite Images.	CIARP	2007	DBLP DOI BibTeX RDF	road detection, MRF-MAP labeling, graph cuts
43	Manfred Padberg	Classical Cuts for Mixed-Integer Programming and Branch-and-Cut.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	Gomory cuts, mixed-integer programming, branch-and-cut, cutting planes
43	Jonathan Eckstein, Mikhail Nediak	Depth-Optimized Convexity Cuts.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	convexity cuts, integer programming, cutting planes
43	Jiangjian Xiao, Mubarak Shah	Motion Layer Extraction in the Presence of Occlusion Using Graph Cuts.	IEEE Trans. Pattern Anal. Mach. Intell.	2005	DBLP DOI BibTeX RDF	Layer-based motion segmentation, level set representation, occlusion order constraint, video analysis, graph cuts
43	Bradford W. Hesse	Curb cuts in the virtual community: telework and persons with disabilities.	HICSS (4)	1995	DBLP DOI BibTeX RDF	home working, curb cuts, persons with disabilities, work-place accommodation, U.S. Department of Defense, virtual community, teleworking, telework, social aspects of automation, physical impairments, handicapped aids
42	Florent Cadoux	Computing deep facet-defining disjunctive cuts for mixed-integer programming.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C10
42	Jinhui Xu 0001, Lei Xu 0006, Evanthia Papadopoulou	Computing the Map of Geometric Minimal Cuts.	ISAAC	2009	DBLP DOI BibTeX RDF
42	David R. Karger, Debmalya Panigrahi	A near-linear time algorithm for constructing a cactus representation of minimum cuts.	SODA	2009	DBLP DOI BibTeX RDF
42	Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi 0001	Projected Chvátal-Gomory cuts for mixed integer linear programs.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C10, 90C57, 90C11
42	Akira Suga, Keita Fukuda, Tetsuya Takiguchi, Yasuo Ariki	Object recognition and segmentation using SIFT and Graph Cuts.	ICPR	2008	DBLP DOI BibTeX RDF
42	Oskar Åkerlund, Mattias Unger, Rui Wang 0003	Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs.	PG	2007	DBLP DOI BibTeX RDF
42	Tommy W. H. Tang, Albert C. S. Chung	Non-rigid Image Registration Using Graph-cuts.	MICCAI (1)	2007	DBLP DOI BibTeX RDF
42	Antonio Frangioni, Claudio Gentile	Perspective cuts for a class of convex 0-1 mixed integer programs.	Math. Program.	2006	DBLP DOI BibTeX RDF	Unit Commitment problem, Mixed-Integer Programs, Portfolio Optimization, Valid Inequalities
42	Dongfeng Han, Wenhui Li 0002, Xiaosuo Lu, Yi Wang, Xiaoqiang Zou	Certain Object Segmentation Based on AdaBoost Learning and Nodes Aggregation Iterative Graph-Cuts.	AMDO	2006	DBLP DOI BibTeX RDF
42	Ning Xu 0005, Ravi Bansal, Narendra Ahuja	Object Segmentation Using Graph Cuts Based Active Contours.	CVPR (2)	2003	DBLP DOI BibTeX RDF
42	David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook	TSP Cuts Which Do Not Conform to the Template Paradigm.	Computational Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
42	Kuo-Hui Tsai, D. T. Lee	k-Best Cuts for Circular-Arc Graphs.	ISAAC	1994	DBLP DOI BibTeX RDF
38	Adrian A. López, José A. Malpica	High Resolution Satellite Classification with Graph Cut Algorithms.	ISVC (2)	2008	DBLP DOI BibTeX RDF	high resolution imagery, k-means, Graph cuts, unsupervised classification
37	Egon Balas, Anureet Saxena	Optimizing over the split closure.	Math. Program.	2008	DBLP DOI BibTeX RDF
37	Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy	Cake-Cutting Is Not a Piece of Cake.	STACS	2003	DBLP DOI BibTeX RDF
37	Matthias Baaz, Alexander Leitsch, Georg Moser	System Description: CutRes 0.1: Cut Elimination by Resolution.	CADE	1999	DBLP DOI BibTeX RDF
37	David R. Karger, Clifford Stein 0001	A New Approach to the Minimum Cut Problem.	J. ACM	1996	DBLP DOI BibTeX RDF	parallel computing, randomized algorithm, graph algorithm, network reliability, minimum cut
37	Egon Balas, Tamás Kis	On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts.	Math. Program.	2016	DBLP DOI BibTeX RDF
37	Egon Balas, Michael Perregaard	A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming.	Math. Program.	2003	DBLP DOI BibTeX RDF
37	Renling Jin	Type Two Cuts, Bad Cuts and Very Bad Cuts.	J. Symb. Log.	1997	DBLP DOI BibTeX RDF
35	Erik L. G. Wernersson, Anders Brun, Cris L. Luengo Hendriks	Segmentation of Wood Fibres in 3D CT Images Using Graph Cuts.	ICIAP	2009	DBLP DOI BibTeX RDF	microtomography (?CT), wood fibres, composite materials, graph cuts
35	Petr A. Golovach, Dimitrios M. Thilikos	Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms.	IWPEC	2009	DBLP DOI BibTeX RDF	Bounded length disjoint paths, Bounded length cuts, Parameterized Complexity, Parameterized Algorithms
35	Yi Deng, Qiong Yang, Xueyin Lin, Xiaoou Tang	Stereo Correspondence with Occlusion Handling in a Symmetric Patch-Based Graph-Cuts Model.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	segmentation, occlusion, Stereo, energy minimization, graph-cuts, correspondence
35	Cheng Chen, Houqiang Li, Xiaobo Zhou 0001	Automated Segmentation of Drosophila RNAi Fluorescence Cellular Images Using Graph Cuts.	MMM (1)	2007	DBLP DOI BibTeX RDF	graph cuts based active contours, RNAi, image segmentation, control points, fluorescence microscopy
35	Ning Zhang 0023, Ling Guan	Graph Cuts in Content-Based Image Classification and Retrieval with Relevance Feedback.	PCM	2007	DBLP DOI BibTeX RDF	Maximum-flow/minimum-cut, Relevance Feedback, Content-based Image Retrieval, Radial Basis Function, Graph Cuts
35	Daniel Freedman, Matthew W. Turek	Illumination-Invariant Tracking via Graph Cuts.	CVPR (2)	2005	DBLP DOI BibTeX RDF	tracking, optical flow, graph cuts, illumination invariance
35	Daniel Freedman, Petros Drineas	Energy Minimization via Graph Cuts: Settling What is Possible.	CVPR (2)	2005	DBLP DOI BibTeX RDF	energy minimization, graph cuts
35	Cláudio T. Silva, Joseph S. B. Mitchell, Arie E. Kaufman	Automatic Generation of Triangular Irregular Networks Using Greedy Cuts.	IEEE Visualization	1995	DBLP DOI BibTeX RDF	triangular irregular networks, dense terrain models, greedy cuts, minimum-link paths, closed polygon, ear cutting, greedy biting, edge splitting, structural terrain fidelity, input height array, graph theory, triangulation, data visualisation, mesh generation, running time, automatic generation, memory requirements
35	Minoru Maruyama, Shigeru Abe	Range Sensing by Projecting Multiple Slits with Random Cuts.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	multiple slits projection, segment matching, random cuts, range sensing, random dots, 3-D data, adjacency relations, image segmentation, image segmentation, image recognition, image recognition
34	Siddharth Barman, Shuchi Chawla 0001	Packing multiway cuts in capacitated graphs.	SODA	2009	DBLP DOI BibTeX RDF
34	Melih S. Aslan, Asem M. Ali, Ham M. Rara, Ben Arnold, Aly A. Farag, Rachid Fahmi, Ping Xiang	A Novel 3D Segmentation of Vertebral Bones from Volumetric CT Images Using Graph Cuts.	ISVC (2)	2009	DBLP DOI BibTeX RDF
34	Zachary A. Garrett, Hideo Saito	Real-Time Online Video Object Silhouette Extraction Using Graph Cuts on the GPU.	ICIAP	2009	DBLP DOI BibTeX RDF
34	Daniel García-Lorenzo, Jérémy Lecoeur, Douglas L. Arnold, D. Louis Collins, Christian Barillot	Multiple Sclerosis Lesion Segmentation Using an Automatic Multimodal Graph Cuts.	MICCAI (1)	2009	DBLP DOI BibTeX RDF
34	Zachary A. Garrett, Hideo Saito	Live video object tracking and segmentation using graph cuts.	ICIP	2008	DBLP DOI BibTeX RDF
34	Mingyu Xiao 0001	Algorithms for Multiterminal Cuts.	CSR	2008	DBLP DOI BibTeX RDF	Multiterminal Cut, Graph Algorithm, Fixed Parameter Tractability, Multicut
34	Jean Cousty, Gilles Bertrand 0001, Laurent Najman, Michel Couprie	On Watershed Cuts and Thinnings.	DGCI	2008	DBLP DOI BibTeX RDF
34	Li-Pu Yeh, Biing-Feng Wang	Efficient Algorithms for the kSmallest Cuts Enumeration.	COCOON	2008	DBLP DOI BibTeX RDF
34	Vladimir Kolmogorov, Carsten Rother	Minimizing Nonsubmodular Functions with Graph Cuts-A Review.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	quadratic pseudo-Boolean optimization, min cut/max flow, texture restoration, Markov Random Fields, Energy minimization
34	Alper Atamtürk, Vishnu Narayanan	Cuts for Conic Mixed-Integer Programming.	IPCO	2007	DBLP DOI BibTeX RDF	Integer programming, branch-and-cut, conic programming
34	Michel Sarkis, Nikolas Dörfler, Klaus Diepold	Fast Adaptive Graph-Cuts Based Stereo Matching.	ACIVS	2007	DBLP DOI BibTeX RDF
34	Tomoyuki Nagahashi, Hironobu Fujiyoshi, Takeo Kanade	Image Segmentation Using Iterated Graph Cuts Based on Multi-scale Smoothing.	ACCV (2)	2007	DBLP DOI BibTeX RDF
34	Gérard Cornuéjols, Claude Lemaréchal	A convex-analysis perspective on disjunctive cuts.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52A41, 90C11
34	Pushmeet Kohli, Philip H. S. Torr	Measuring Uncertainty in Graph Cut Solutions - Efficiently Computing Min-marginal Energies Using Dynamic Graph Cuts.	ECCV (2)	2006	DBLP DOI BibTeX RDF
34	Dongfeng Han, Wenhui Li 0002, Xiaosuo Lu, Tianzhu Wang, Yi Wang	Automatic Segmentation Based on AdaBoost Learning and Graph-Cuts.	ICIAR (1)	2006	DBLP DOI BibTeX RDF
34	Kent Andersen, Gérard Cornuéjols, Yanjun Li	Split closure and intersection cuts.	Math. Program.	2005	DBLP DOI BibTeX RDF
34	Frithjof Dau	Query Graphs with Cuts: Mathematical Foundations.	Diagrams	2004	DBLP DOI BibTeX RDF
34	Ismael R. de Farias Jr.	Semi-continuous Cuts for Mixed-Integer Programming.	IPCO	2004	DBLP DOI BibTeX RDF	semi-continuous variables, mixed-integer programming, branch-and-cut, polyhedral combinatorics, disjunctive programming
34	Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai	A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.	SODA	2004	DBLP BibTeX RDF
34	Marshall F. Tappen, William T. Freeman	Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters.	ICCV	2003	DBLP DOI BibTeX RDF
34	Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner	Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles.	GD	2003	DBLP DOI BibTeX RDF
34	Kent Andersen, Gérard Cornuéjols, Yanjun Li	Split Closure and Intersection Cuts.	IPCO	2002	DBLP DOI BibTeX RDF
34	Han-Wen Nienhuys, A. Frank van der Stappen	A Surgery Simulation Supporting Cuts and Finite Element Deformation.	MICCAI	2001	DBLP DOI BibTeX RDF
34	David R. Karger	Minimum cuts in near-linear time.	J. ACM	2000	DBLP DOI BibTeX RDF	tree packing, optimization, connectivity, min-cut, Monte Carlo algorithm
34	Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner	How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract).	GD	2000	DBLP DOI BibTeX RDF
34	Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki	Computing All Small Cuts in Undirected Networks.	ISAAC	1994	DBLP DOI BibTeX RDF
34	Vijay V. Vazirani, Mihalis Yannakakis	Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract).	ICALP	1992	DBLP DOI BibTeX RDF
31	Les R. Foulds, Bilal Toklu, John M. Wilson 0001	Modelling either-or relations in integer programming.	Ann. Oper. Res.	2009	DBLP DOI BibTeX RDF	Logical conditions, Integer programming, Cuts, Formulation
31	Chengqian Wu, Xiang Bai, Quannan Li, Xingwei Yang, Wenyu Liu 0001	Contour Grouping with Partial Shape Similarity.	PSIVT	2009	DBLP DOI BibTeX RDF	Contour grouping, partial shape similarity, particle filter, Normalized Cuts
31	Ramkumar Karuppiah, Ignacio E. Grossmann	A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures.	J. Glob. Optim.	2008	DBLP DOI BibTeX RDF	Lagrangean decomposition, Two-stage stochastic programming, Global optimization, Cuts
31	Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir Kolmogorov, Aseem Agarwala, Marshall F. Tappen, Carsten Rother	A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors.	IEEE Trans. Pattern Anal. Mach. Intell.	2008	DBLP DOI BibTeX RDF	Global optimization, Markov random fields, Graph cuts, Belief propagation, Performance evaluation of algorithms and systems