|
|
Venues (Conferences, Journals, ...)
|
|
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 |
146 | Jin-Tai Yan |
An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 366-371, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2006 International Conference on Computer-Aided Design, ICCAD 2006, San Jose, CA, USA, November 5-9, 2006, pp. 143-150, 2006, ACM, 1-59593-389-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
81 | Matteo Fischetti, Cristiano Saturni |
Mixed-Integer Cuts from Cyclic Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings, pp. 1-11, 2005, Springer, 3-540-26199-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 104(1), pp. 179-202, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
71 | Yefim Dinitz |
The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings, pp. 145-157, 1992, Springer, 3-540-56402-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
69 | Sanjeeb Dash, Oktay Günlük |
On the strength of Gomory mixed-integer cuts as group cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(2), pp. 387-407, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 109(1), pp. 27-53, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(2), pp. 375-391, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 10th IEEE International Conference on Computer Vision (ICCV 2005), 17-20 October 2005, Beijing, China, pp. 564-571, 2005, IEEE Computer Society, 0-7695-2334-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
59 | Taiga Takata, Yusuke Matsunaga |
An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 19th ACM Great Lakes Symposium on VLSI 2009, Boston Area, MA, USA, May 10-12 2009, pp. 351-356, 2009, ACM, 978-1-60558-522-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
FPGA, logic synthesis, technology mapping |
58 | Charles Audet, Jean Haddad, Gilles Savard |
Disjunctive cuts for continuous linear bilevel programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 1(3), pp. 259-267, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PSIVT ![In: Advances in Image and Video Technology, Second Pacific Rim Symposium, PSIVT 2007, Santiago, Chile, December 17-19, 2007, Proceedings, pp. 715-726, 2007, Springer, 978-3-540-77128-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DICTA ![In: Proceedings of the International Conference on Digital Image Computing: Techniques and Applications, DICTA 2008, Canberra, ACT, Australia, 1-3 December 2008, pp. 564-571, 2008, IEEE Computer Society, 978-0-7695-3456-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
57 | Vladimir Kolmogorov, Ramin Zabih |
What Energy Functions Can Be Minimized via Graph Cuts? ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(2), pp. 147-159, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 87-98, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
52 | Frithjof Dau |
An Embedding of Existential Graphs into Concept Graphs with Negations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Integration and Interfaces, 10th International Conference on Conceptual Structures, ICCS 2002, Borovets, Bulgaria, July 15-19, 2002, Proceedings, pp. 326-340, 2002, Springer, 3-540-43901-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(10), pp. 1519-1526, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
50 | Lewis Ntaimo, Matthew W. Tanner |
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 41(3), pp. 365-384, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 122(1), pp. 1-20, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR ![In: 19th International Conference on Pattern Recognition (ICPR 2008), December 8-11, 2008, Tampa, Florida, USA, pp. 1-4, 2008, IEEE Computer Society, 978-1-4244-2175-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 693-704, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
49 | Yuri Boykov, Gareth Funka-Lea |
Graph Cuts and Efficient N-D Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 70(2), pp. 109-131, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
49 | Olivier Juan, Yuri Boykov |
Active Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR (1) ![In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2006), 17-22 June 2006, New York, NY, USA, pp. 1023-1029, 2006, IEEE Computer Society, 0-7695-2597-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 10th IEEE International Conference on Computer Vision (ICCV 2005), 17-20 October 2005, Beijing, China, pp. 259-265, 2005, IEEE Computer Society, 0-7695-2334-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar |
Short-Cuts on Star, Source and Planar Unfoldings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings, pp. 174-185, 2004, Springer, 3-540-24058-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
49 | Vladimir Kolmogorov, Ramin Zabih |
What Energy Functions Can Be Minimized via Graph Cuts? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (3) ![In: Computer Vision - ECCV 2002, 7th European Conference on Computer Vision, Copenhagen, Denmark, May 28-31, 2002, Proceedings, Part III, pp. 65-81, 2002, Springer, 3-540-43746-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
49 | Marcin Skubiszewski, Nicolas Porteix |
Partly-Consistent Cuts of Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings, pp. 488-495, 1997, Springer, 3-540-63440-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
49 | Adam Dingle, Richard J. Fateman |
Branch Cuts in Computer Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, Oxford, UK, July 20-22, 1994, pp. 250-257, 1994, ACM, 0-89791-638-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Mathematica |
47 | Sanjiv Kapoor |
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 132-146, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
45 | Pablo Rey, Claudia A. Sagastizábal |
Convex Normalizations in Lift-and-Project Methods for 0-1 Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 116(1-4), pp. 91-112, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 112(1), pp. 3-44, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 27(5), pp. 128, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | András A. Benczúr |
A Representation of Cuts within 6/5 Times the Edge Connectivity with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 92-102, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 159-166, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIS ![In: 15th ACM International Symposium on Geographic Information Systems, ACM-GIS 2007, November 7-9, 2007, Seattle, Washington, USA, Proceedings, pp. 64, 2007, ACM, 978-1-59593-914-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIARP ![In: Progress in Pattern Recognition, Image Analysis and Applications, 12th Iberoamericann Congress on Pattern Recognition, CIARP 2007, Valparaiso, Chile, November 13-16, 2007, Proceedings, pp. 162-171, 2007, Springer, 978-3-540-76724-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 139(1), pp. 321-352, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Gomory cuts, mixed-integer programming, branch-and-cut, cutting planes |
43 | Jonathan Eckstein, Mikhail Nediak |
Depth-Optimized Convexity Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 139(1), pp. 95-129, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 27(10), pp. 1644-1659, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (4) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 418-425, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 122(2), pp. 197-223, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 244-254, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | David R. Karger, Debmalya Panigrahi |
A near-linear time algorithm for constructing a cactus representation of minimum cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 246-255, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 113(2), pp. 241-257, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR ![In: 19th International Conference on Pattern Recognition (ICPR 2008), December 8-11, 2008, Tampa, Florida, USA, pp. 1-4, 2008, IEEE Computer Society, 978-1-4244-2175-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Oskar Åkerlund, Mattias Unger, Rui Wang 0003 |
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PG ![In: 15th Pacific Conference on Computer Graphics and Applications, PG 2007, Maui, HI, USA, October 29 - November 2, 2007, pp. 161-170, 2007, IEEE Computer Society, 978-0-7695-3009-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Tommy W. H. Tang, Albert C. S. Chung |
Non-rigid Image Registration Using Graph-cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICCAI (1) ![In: Medical Image Computing and Computer-Assisted Intervention - MICCAI 2007, 10th International Conference, Brisbane, Australia, October 29 - November 2, 2007, Proceedings, Part I, pp. 916-924, 2007, Springer, 978-3-540-75756-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Antonio Frangioni, Claudio Gentile |
Perspective cuts for a class of convex 0-1 mixed integer programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(2), pp. 225-236, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMDO ![In: Articulated Motion and Deformable Objects, 4th International Conference, AMDO 2006, Port d'Andratx, Mallorca, Spain, July 11-14, 2006, Proceedings, pp. 196-202, 2006, Springer, 3-540-36031-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Ning Xu 0005, Ravi Bansal, Narendra Ahuja |
Object Segmentation Using Graph Cuts Based Active Contours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR (2) ![In: 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2003), 16-22 June 2003, Madison, WI, USA, pp. 46-53, 2003, IEEE Computer Society, 0-7695-1900-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Combinatorial Optimization ![In: Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000], pp. 261-304, 2001, Springer, 3-540-42877-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
42 | Kuo-Hui Tsai, D. T. Lee |
k-Best Cuts for Circular-Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 550-558, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
38 | Adrian A. López, José A. Malpica |
High Resolution Satellite Classification with Graph Cut Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVC (2) ![In: Advances in Visual Computing, 4th International Symposium, ISVC 2008, Las Vegas, NV, USA, December 1-3, 2008. Proceedings, Part II, pp. 105-112, 2008, Springer, 978-3-540-89645-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
high resolution imagery, k-means, Graph cuts, unsupervised classification |
37 | Egon Balas, Anureet Saxena |
Optimizing over the split closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 113(2), pp. 219-240, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy |
Cake-Cutting Is Not a Piece of Cake. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 596-607, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Matthias Baaz, Alexander Leitsch, Georg Moser |
System Description: CutRes 0.1: Cut Elimination by Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-16, 16th International Conference on Automated Deduction, Trento, Italy, July 7-10, 1999, Proceedings, pp. 212-216, 1999, Springer, 3-540-66222-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
37 | David R. Karger, Clifford Stein 0001 |
A New Approach to the Minimum Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 43(4), pp. 601-640, 1996. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 160(1-2), pp. 85-114, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 94(2-3), pp. 221-245, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Renling Jin |
Type Two Cuts, Bad Cuts and Very Bad Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 62(4), pp. 1241-1252, 1997. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: Image Analysis and Processing - ICIAP 2009, 15th International Conference Vietri sul Mare, Italy, September 8-11, 2009, Proceedings, pp. 92-102, 2009, Springer, 978-3-642-04145-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 210-221, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(6), pp. 1068-1079, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMM (1) ![In: Advances in Multimedia Modeling, 13th International Multimedia Modeling Conference, MMM 2007, Singapore, January 9-12, 2007. Proceedings, Part I, pp. 116-125, 2007, Springer, 978-3-540-69421-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PCM ![In: Advances in Multimedia Information Processing - PCM 2007, 8th Pacific Rim Conference on Multimedia, Hong Kong, China, December 11-14, 2007, Proceedings, pp. 30-39, 2007, Springer, 978-3-540-77254-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR (2) ![In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), 20-26 June 2005, San Diego, CA, USA, pp. 10-17, 2005, IEEE Computer Society, 0-7695-2372-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR (2) ![In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), 20-26 June 2005, San Diego, CA, USA, pp. 939-946, 2005, IEEE Computer Society, 0-7695-2372-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Visualization ![In: 6th IEEE Visualization Conference, IEEE Vis 1995, Atlanta, GA, USA, October 29 - November 3, 1995, Proceedings, pp. 201-208, 1995, IEEE Computer Society Press, 0-8186-7187-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(6), pp. 647-651, 1993. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 1048-1057, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVC (2) ![In: Advances in Visual Computing, 5th International Symposium, ISVC 2009, Las Vegas, NV, USA, November 30 - December 2, 2009, Proceedings, Part II, pp. 519-528, 2009, Springer, 978-3-642-10519-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Zachary A. Garrett, Hideo Saito |
Real-Time Online Video Object Silhouette Extraction Using Graph Cuts on the GPU. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: Image Analysis and Processing - ICIAP 2009, 15th International Conference Vietri sul Mare, Italy, September 8-11, 2009, Proceedings, pp. 985-994, 2009, Springer, 978-3-642-04145-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICCAI (1) ![In: Medical Image Computing and Computer-Assisted Intervention - MICCAI 2009, 12th International Conference, London, UK, September 20-24, 2009, Proceedings, Part II, pp. 584-591, 2009, Springer, 978-3-642-04270-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Zachary A. Garrett, Hideo Saito |
Live video object tracking and segmentation using graph cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings of the International Conference on Image Processing, ICIP 2008, October 12-15, 2008, San Diego, California, USA, pp. 1576-1579, 2008, IEEE, 978-1-4244-1765-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Mingyu Xiao 0001 |
Algorithms for Multiterminal Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 314-325, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 14th IAPR International Conference, DGCI 2008, Lyon, France, April 16-18, 2008. Proceedings, pp. 434-445, 2008, Springer, 978-3-540-79125-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Li-Pu Yeh, Biing-Feng Wang |
Efficient Algorithms for the kSmallest Cuts Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 434-443, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir Kolmogorov, Carsten Rother |
Minimizing Nonsubmodular Functions with Graph Cuts-A Review. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(7), pp. 1274-1279, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, pp. 16-29, 2007, Springer, 978-3-540-72791-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIVS ![In: Advanced Concepts for Intelligent Vision Systems, 9th International Conference, ACIVS 2007, Delft, The Netherlands, August 28-31, 2007, Proceedings, pp. 818-827, 2007, Springer, 978-3-540-74606-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Tomoyuki Nagahashi, Hironobu Fujiyoshi, Takeo Kanade |
Image Segmentation Using Iterated Graph Cuts Based on Multi-scale Smoothing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACCV (2) ![In: Computer Vision - ACCV 2007, 8th Asian Conference on Computer Vision, Tokyo, Japan, November 18-22, 2007, Proceedings, Part II, pp. 806-816, 2007, Springer, 978-3-540-76389-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Gérard Cornuéjols, Claude Lemaréchal |
A convex-analysis perspective on disjunctive cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(3), pp. 567-586, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (2) ![In: Computer Vision - ECCV 2006, 9th European Conference on Computer Vision, Graz, Austria, May 7-13, 2006, Proceedings, Part II, pp. 30-43, 2006, Springer, 3-540-33834-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAR (1) ![In: Image Analysis and Recognition, Third International Conference, ICIAR 2006, Póvoa de Varzim, Portugal, September 18-20, 2006, Proceedings, Part I, pp. 215-225, 2006, Springer, 3-540-44891-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Kent Andersen, Gérard Cornuéjols, Yanjun Li |
Split closure and intersection cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 102(3), pp. 457-493, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Frithjof Dau |
Query Graphs with Cuts: Mathematical Foundations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Diagrams ![In: Diagrammatic Representation and Inference, Third International Conference, Diagrams 2004, Cambridge, UK, March 22-24, 2004, Proceedings, pp. 32-50, 2004, Springer, 3-540-21268-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Ismael R. de Farias Jr. |
Semi-continuous Cuts for Mixed-Integer Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 163-177, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 828-829, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
34 | Marshall F. Tappen, William T. Freeman |
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 9th IEEE International Conference on Computer Vision (ICCV 2003), 14-17 October 2003, Nice, France, pp. 900-907, 2003, IEEE Computer Society, 0-7695-1950-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner |
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers, pp. 357-368, 2003, Springer, 3-540-20831-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Kent Andersen, Gérard Cornuéjols, Yanjun Li |
Split Closure and Intersection Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 127-144, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Han-Wen Nienhuys, A. Frank van der Stappen |
A Surgery Simulation Supporting Cuts and Finite Element Deformation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICCAI ![In: Medical Image Computing and Computer-Assisted Intervention - MICCAI 2001, 4th International Conference, Utrecht, The Netherlands, October 14-17, 2001, Proceedings, pp. 145-152, 2001, Springer, 3-540-42697-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | David R. Karger |
Minimum cuts in near-linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(1), pp. 46-76, 2000. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings, pp. 103-114, 2000, Springer, 3-540-41554-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
34 | Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki |
Computing All Small Cuts in Undirected Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 190-198, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Vijay V. Vazirani, Mihalis Yannakakis |
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 366-377, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
31 | Les R. Foulds, Bilal Toklu, John M. Wilson 0001 |
Modelling either-or relations in integer programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 166(1), pp. 203-222, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PSIVT ![In: Advances in Image and Video Technology, Third Pacific Rim Symposium, PSIVT 2009, Tokyo, Japan, January 13-16, 2009. Proceedings, pp. 167-178, 2009, Springer, 978-3-540-92956-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 41(2), pp. 163-186, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 30(6), pp. 1068-1080, 2008. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|