The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase S-cuts (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1963-1973 (16) 1974-1981 (16) 1982-1985 (23) 1986-1988 (15) 1989-1990 (21) 1991-1992 (31) 1993 (22) 1994 (19) 1995 (33) 1996 (27) 1997 (24) 1998 (23) 1999 (54) 2000 (52) 2001 (79) 2002 (75) 2003 (83) 2004 (126) 2005 (140) 2006 (161) 2007 (228) 2008 (221) 2009 (151) 2010 (132) 2011 (120) 2012 (108) 2013 (111) 2014 (101) 2015 (94) 2016 (83) 2017 (88) 2018 (91) 2019 (79) 2020 (84) 2021 (83) 2022 (82) 2023 (74) 2024 (13)
Publication types (Num. hits)
article(1334) book(2) data(1) incollection(15) inproceedings(1613) phdthesis(18)
Venues (Conferences, Journals, ...)
CoRR(208) Math. Program.(81) IPCO(59) CVPR(51) ICIP(46) ICCV(42) IEEE Trans. Pattern Anal. Mach...(40) SODA(40) ISBI(30) Oper. Res. Lett.(30) Discret. Math.(29) Algorithmica(25) STOC(23) ESA(22) ISAAC(22) Discret. Appl. Math.(21) More (+10 of total 932)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1168 occurrences of 782 keywords

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