|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3915 occurrences of 2226 keywords
|
|
|
Results
Found 8506 publication records. Showing 8499 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
106 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 179-188, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow |
90 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(2), pp. 6:1-6:28, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Directed multicut, hardness of approximation, sparsest cut |
78 | WoongChul Choi, JinWoo Han, Byung Joon Park, Jiman Hong |
BCTMA(Bi-directional Cut-Through Medium Access) Protocol for 802.11-Based Multi-hop Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSADS ![In: Advanced Distributed Systems: 5th International School and Symposium, ISSADS 2005, Guadalajara, Mexico, January 24-28, 2005, Revised Selected Papers, pp. 377-387, 2005, Springer, 3-540-28063-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Forward cut-through scheme, Backward cut-through scheme, BCTMA (Bi-directional Cut-Through Medium Access) protocol, DCF (Distributed Coordination Function), IEEE 802.11, Wireless multi-hop networks |
74 | Chandra Chekuri, Sudipto Guha, Joseph Naor |
Approximating Steiner k-Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 189-199, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Multiway Cut, $k$-Cut, Steiner tree, minimum cut, primal-dual |
74 | Takehiro Ito, Marcin Kaminski 0001, Daniël Paulusma, Dimitrios M. Thilikos |
Parameterizing Cut Sets in a Graph by the Number of Their Components. ![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. 605-615, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
72 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the Min-Max (Regret) Versions of Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 789-798, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, s–t min cut, complexity, min cut, min-max |
70 | Hannah Honghua Yang, D. F. Wong 0001 |
New algorithms for min-cut replication in partitioned circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 216-222, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Hyper-MAMC, VLSI circuit partitioning, k-way partition, k-way partitioned digraph, min-cut replication, partitioned circuits, VLSI, optimal algorithm, circuit layout CAD, hypergraphs, VLSI layout, digraphs, circuit layout |
68 | Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato |
Adaptive cut line selection in min-cut placement for large scale sea-of-gates arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1994, San Jose, California, USA, November 6-10, 1994, pp. 428-431, 1994, IEEE Computer Society / ACM, 0-89791-690-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
64 | Hannah Honghua Yang, Martin D. F. Wong |
Optimal min-area min-cut replication in partitioned circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(11), pp. 1175-1183, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
62 | Olivier Hermant |
Semantic Cut Elimination in the Intuitionistic Sequent Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, pp. 221-233, 2005, Springer, 3-540-25593-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
intuitionistic sequent calculus, cut admissibility, cut elimination property, semantic, Kripke Structure, deduction modulo |
62 | Kai Brünnler |
Atomic Cut Elimination for classical Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings, pp. 86-97, 2003, Springer, 3-540-40801-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
atomic cut, sequent calculus, cut elimination, natural deduction, classical logic |
61 | 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 |
60 | Song Wang 0002, Jeffrey Mark Siskind |
Image Segmentation with Ratio Cut - Supplemental Material. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 25(6), 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Graph partitioning algorithms, cut ratio, cycle ratio, image segmentation, edge detection, machine vision, perceptual organization, perfect matching |
60 | Song Wang 0002, Jeffrey Mark Siskind |
Image Segmentation with Ratio Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 25(6), pp. 675-690, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Graph partitioning algorithms, cut ratio, cycle ratio, image segmentation, edge detection, machine vision, perceptual organization, perfect matching |
60 | Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida |
A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(2), pp. 262-276, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure |
58 | Teofilo F. Gonzalez, Toshio Murayama |
Alhorithms for a Class of Min-Cut and Max-Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, pp. 97-105, 1992, Springer, 3-540-56279-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
57 | Manfred Wamsler |
On the selection of the mode cut-off number in component mode reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 25(2), pp. 139-146, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Structural dynamics, Component mode reduction, Component mode synthesis, Mixed Guyan and modal reduction, Craig-Bampton method, Direct solution formulation, Modal solution formulation, Mode cut-off number, Cut-off frequency |
55 | Ryan O'Donnell, Yi Wu 0002 |
An optimal sdp algorithm for max-cut, and equally optimal long code tests. ![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. 335-344, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
semidefinite programming, hardness of approximation, max-cut |
55 | Hanwen Guo, Minyong Shi, Zhiguo Hong, Rui Yang, Li Zhang |
Virtual Artistic Paper-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Edutainment ![In: Technologies for E-Learning and Digital Entertainment, Third International Conference, Edutainment 2008, Nanjing, China, June 25-27, 2008, Proceedings, pp. 707-718, 2008, Springer, 978-3-540-69734-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subdivision Curve, Paper-Cut, NPR, SVG, Contour Extraction, Polygon Clipping |
55 | Julia Chuzhoy, Sanjeev Khanna |
Hardness of cut problems in directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 527-536, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
directed multicut, hardness of approximation, sparsest cut |
55 | Wai-Kei Mak, D. F. Wong 0001 |
Minimum replication min-cut partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10-14, 1996, pp. 205-210, 1996, IEEE Computer Society / ACM, 0-8186-7597-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
min-cut partitioning, circuit partitioning, logic replication |
54 | Alexandre X. Falcão, Paulo A. V. Miranda, Anderson Rocha 0001 |
A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIVS ![In: Advanced Concepts for Intelligent Vision Systems, 8th International Conference, ACIVS 2006, Antwerp, Belgium, September 18-21, 2006, Proceedings, pp. 138-149, 2006, Springer, 3-540-44630-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
54 | Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi |
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. ![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. 157-222, 2001, Springer, 3-540-42877-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
51 | Hans L. Bodlaender, Babette van Antwerpen-de Fluiter |
Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(4), pp. 534-559, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure |
51 | Tamal K. Dey, Kuiyu Li |
Cut locus and topology from surface point data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 125-134, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
cut locus, rips complex, surface point cloud, topology, differential geometry |
51 | Yong He 0003, Sixin Xu, Kejun Zhu, Ting Liu, Yue Li |
A Genetic-Neural Method of Optimizing Cut-Off Grade and Grade of Crude Ore. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (2) ![In: Advances in Neural Networks - ISNN 2008, 5th International Symposium on Neural Networks, ISNN 2008, Beijing, China, September 24-28, 2008, Proceedings, Part II, pp. 588-597, 2008, Springer, 978-3-540-87733-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Genetic-neural optimization, Cut-off grade, Grade of crude ore |
51 | 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 |
50 | Monique Laurent |
Semidefinite Relaxations for Max-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 257-290, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
50 | Hervé Kerivin, Ali Ridha Mahjoub, Charles Nocq |
(1, 2)-Survivable Networks: Facets and Branch-and-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 121-152, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
49 | Padmanabhan Soundararajan, Sudeep Sarkar |
An In-Depth Study of Graph Partitioning Measures for Perceptual Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 25(6), pp. 642-660, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
grouping, graph partitioning, empirical evaluation, Perceptual organization, stochastic orders |
49 | Chandra Chekuri, Sanjeev Khanna |
Algorithms for 2-Route Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 472-484, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Alejandro Duran, Julita Corbalán, Eduard Ayguadé |
An adaptive cut-off for task parallelism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings of the ACM/IEEE Conference on High Performance Computing, SC 2008, November 15-21, 2008, Austin, Texas, USA, pp. 36, 2008, IEEE/ACM, 978-1-4244-2835-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Subhash Khot, Nisheeth K. Vishnoi |
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 53-62, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Yu G. Chen, Maria C. Yuang |
An efficient terminal-pair reliability algorithm for network management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 20th Conference on Local Computer Networks (LCN'95), Minneapolis, Minnesota, USA, October 16-19, 1995, pp. 53-61, 1995, IEEE Computer Society, 0-8186-7162-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
terminal-pair reliability, probabilistic reliability, path-based partition method, network reduction technique, cut-based partition algorithm, network reduction, performance evaluation, network management, computer network management, minimum cut, failure probabilities |
47 | Jiabing Wang, Hong Peng, Jing-Song Hu, Chuangxin Yang |
A Graph Clustering Algorithm Based on Minimum and Normalized Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (1) ![In: Computational Science - ICCS 2007, 7th International Conference Beijing, China, May 27-30, 2007, Proceedings, Part I, pp. 497-504, 2007, Springer, 978-3-540-72583-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
image segmentation, graph clustering, minimum cut, normalized cut |
46 | Hoang Tuy |
Cutting Plane Methods for Global Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 590-594, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Inner approximation, Polyhedral annexation, Concavity cut, Intersection cut, Convexity cut, Nonlinear cut, Polyblock approximation, Monotonic optimization, Outer approximation, Cutting plane method |
46 | Qiusong Yang, Mingshu Li 0001 |
A cut-off approach for bounded verification of parameterized systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE (1) ![In: Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1, ICSE 2010, Cape Town, South Africa, 1-8 May 2010, pp. 345-354, 2010, ACM, 978-1-60558-719-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
cut-off, bounded model checking, parameterized system |
46 | Monia Giandomenico, Adam N. Letchford |
Exploring the Relationship Between Max-Cut and Stable Set Relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(1), pp. 159-175, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Stable set problem, Polyhedral combinatorics, Max-cut problem |
46 | Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin |
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 39(3), pp. 189-208, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Convex integer programming, Total unimodularity, Network flow, Minimum cut, Nonlinear integer programming |
46 | Reijer Grimbergen |
Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computers and Games ![In: Computers and Games, Second International Conference, CG 2000, Hamamatsu, Japan, October 26-28, 2000, Revised Papers, pp. 315-332, 2000, Springer, 3-540-43080-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Plausible move generation, move merit analysis, cut-off thresholds, shogi |
44 | Reda Alhajj, Ashraf Elnagar |
Multiagents to Separating Handwritten Connected Digits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part A ![In: IEEE Trans. Syst. Man Cybern. Part A 35(5), pp. 593-602, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Padmanabhan Soundararajan, Sudeep Sarkar |
Investigation of Measures for Grouping by Graph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR (1) ![In: 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2001), with CD-ROM, 8-14 December 2001, Kauai, HI, USA, pp. 239-246, 2001, IEEE Computer Society, 0-7695-1272-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
44 | Jin Zhang, Lei Xie 0001, Wei Feng 0005, Yanning Zhang |
A Subword Normalized Cut Approach to Automatic Story Segmentation of Chinese Broadcast News. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AIRS ![In: Information Retrieval Technology, 5th Asia Information Retrieval Symposium, AIRS 2009, Sapporo, Japan, October 21-23, 2009. Proceedings, pp. 136-148, 2009, Springer, 978-3-642-04768-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | David Avis, Hiroshi Imai, Tsuyoshi Ito |
Generating facets for the cut polytope of a graph by triangular elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 112(2), pp. 303-325, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 52B12, 90C57, 05C99 |
44 | Wai-Kei Mak, Martin D. F. Wong |
Minimum replication min-cut partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(10), pp. 1221-1227, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
44 | Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato |
Min-cut placement with global objective functions for large scale sea-of-gates arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(4), pp. 434-446, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
43 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 605-614, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut |
42 | Jianer Chen, Yang Liu 0002, Songjian Lu |
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 1-13, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Multiway cut problem, Network flow, Fixed-parameter tractability, Minimum cut, Parameterized algorithm |
42 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
Generating Cut Conjunctions in Graphs and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(3), pp. 239-263, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Cut conjunction, Cut generation, Graph, Matroid, Multicut |
42 | Ching-Yung Yang, Ja-Chen Lin |
Color quantization by RWM-cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume II, pp. 669-672, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
RWM-cut, radius weighted mean cut, hierarchically divisive method, two-class partition, MSE quantization error, LBG algorithm, initial palette, full-color image, color palette, color image, image colour analysis, centroid, color quantization |
42 | Wei-Kuan Shih, Sun Wu, Yue-Sun Kuo |
Unifying Maximum Cut and Minimum Cut of a Planar Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(5), pp. 694-697, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
maximum cut, nonnegative edge weights, computational complexity, graph theory, planar graph, minimum cut |
42 | Saumya K. Debray, David Scott Warren |
Towards Banishing the Cut from Prolog. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(3), pp. 335-349, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
impure language features, impure features, Prolog source programs, firstof, oneof, declarative readings, parallel evaluation strategies, purer programming style, logic programs, logic programming, static analysis, PROLOG, program transformations, nondeterminism, cut, language constructs, compile time |
41 | Young-Il Lee, Yong-Gi Kim |
Comparison of fuzzy implication operators by means of fuzzy relational products used for intelligent local path-planning of AUVs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 13(6), pp. 535-549, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Autonomous underwater vehicles(AUVs), ?-Cut, Fuzzy relational products, Implication operator, Local path-planning |
41 | Mingyu Xiao 0001 |
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 208-219, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
k-Way Cut, Graph Algorithm, Divide-and-Conquer |
41 | Anand Bhalgat, Tanmoy Chakraborty 0001, Sanjeev Khanna |
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010, pp. 73-82, 2010, ACM, 978-1-60558-822-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
cut games, party affiliation games, potential games, pure nash equilibrium, approximation algorithms |
41 | Dong Liu 0022, Weiyan Xing, Chunyuan Zhang, Rui Li 0051, Haiyan Li |
Cut Sequence Set Generation for Fault Tree Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICESS ![In: Embedded Software and Systems, [Third] International Conference, ICESS 2007, Daegu, Korea, May 14-16, 2007, Proceedings, pp. 592-603, 2007, Springer, 978-3-540-72684-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
cut sequence set, sequential failure expression, fault tree analysis |
41 | Xujia Qin, Xinhua Yang, Hongbo Zheng |
Implicit Surface Boolean Operations Based Cut-and-Paste Algorithm for Mesh Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAT ![In: Advances in Artificial Reality and Tele-Existence, 16th International Conference on Artificial Reality and Telexistence, ICAT 2006, Hangzhou, China, November 29 - December 1, 2006, Proceedings, pp. 839-848, 2006, Springer, 3-540-49776-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
mesh models, point models, implicit surface, Boolean operations, Cut-and-paste |
41 | Francesco Belardinelli, Peter Jipsen, Hiroakira Ono |
Algebraic Aspects of Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 77(2), pp. 209-240, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Algebraic Gentzen systems, finite model property, residuated lattices, cut elimination, substructural logics |
41 | Dvir Steiner, Anath Fischer |
Finding and defining the generators of genus-n objects for constructing topological and cut graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 20(4), pp. 266-278, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Cut graph, Longitude, Meridian, Topological graph, Shape classification |
41 | Francisco Gutiérrez, Blas C. Ruiz |
Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 956-968, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
pure type systems, expansion postponement, Track: B, cut elimination, sequent calculi |
41 | Christian Urban |
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings., pp. 415-430, 2001, Springer, 3-540-41960-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Recursive Path Ordering, Cut-Elimination, Explicit Substitution, Classical Logic |
41 | Wai-Kei Mak |
Min-cut partitioning with functional replication for technology mapped circuits using minimum area overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2001 International Symposium on Physical Design, ISPD 2001, Sonoma County, CA, USA, April 1-4, 2001, pp. 100-105, 2001, ACM, 1-58113-347-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
minimum cut, circuit partitioning, logic replication |
41 | Joseph Naor, Leonid Zosin |
A 2-Approximation Algorithm for the Directed Multiway Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 548-553, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
directed multiway cut problem, 2-approximation algorithm, multiway flow function, NP-complete, directed graphs, polynomial-time algorithm, approximation factor |
40 | Nathan W. Brixius, Kurt M. Anstreicher |
The Steinberg Wiring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 293-307, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Günter M. Ziegler |
Typical and Extremal Linear Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 217-230, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Denis Naddef |
The Domino Inequalities for the Symmetric Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 153-172, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli |
Bicolorings and Equitable Bicolorings of Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 33-37, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Jean Fonlupt |
The Clique-Rank of 3-Chromatic Perfect Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 39-49, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Laurence A. Wolsey |
Time for Old and New Faces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 7-15, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling |
Mixed-Integer Programming: A Progress Report. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 309-325, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel |
On the Way to Perfection: Primal Operations for Stable Sets in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 51-76, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Ralf Borndörfer |
Combinatorial Packing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 19-32, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Martin Grötschel |
Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 99-120, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Petra Mutzel, Michael Jünger |
Graph Drawing: Exact Optimization Helps! ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 327-352, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Annegret Katrin Wagler |
Relaxing Perfectness: Which Graphs Are "Almost" Perfect? ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 77-96, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Volker Kaibel |
On the Expansion of Graphs of 0/1-Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 199-216, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Christoph Helmberg |
A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 233-256, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Marcus Oswald, Gerhard Reinelt |
Computing Optimal Consecutive Ones Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 173-183, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Vijay Chandru, M. Rammohan Rao, Ganesh Swaminathan |
Protein Folding on Lattices: An Integer Programming Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Sharpest Cut ![In: The Sharpest Cut, pp. 185-196, 2004, SIAM, 978-0-89871-552-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
39 | Ye Hou, Bao-Long Guo, Jeng-Shyang Pan 0001 |
The Application and Study of Graph Cut in Motion Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAS ![In: Proceedings of the Fifth International Conference on Information Assurance and Security, IAS 2009, Xi'An, China, 18-20 August 2009, pp. 265-268, 2009, IEEE Computer Society, 978-0-7695-3744-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Marcelo Finger, Dov M. Gabbay |
Cut and Pay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 15(3), pp. 195-218, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Agata Ciabattoni, Kazushige Terui |
Modular Cut-Elimination: Finding Proofs or Counterexamples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings, pp. 135-149, 2006, Springer, 3-540-48281-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Grigori Mints |
Unwinding a Non-effective Cut Elimination Proof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 259-269, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Roee Engelberg, Jochen Könemann, Stefano Leonardi 0001, Joseph Naor |
Cut Problems in Graphs with a Budget Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 435-446, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Irith Pomeranz, Sudhakar M. Reddy |
The Cut Delay Fault Model for Guiding the Generation of n-Detection Test Sets for Transition Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 19th International Conference on VLSI Design (VLSI Design 2006), 3-7 January 2006, Hyderabad, India, pp. 828-831, 2006, IEEE Computer Society, 0-7695-2502-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Reuven Y. Rubinstein |
Cross-entropy and rare events for maximal cut and partition problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 12(1), pp. 27-53, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Combinatorial optimization, importance sampling, cross-entropy, rare event simulation |
39 | 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 |
|
39 | Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis |
All-Pairs Min-Cut in Sparse Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, pp. 363-376, 1995, Springer, 3-540-60692-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
39 | Halimin Herjanto, Muslim Amin, Cut Erika Fatimah |
Does knowledge collecting and donating enhance a bank's salesperson performance? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bus. Process. Manag. J. ![In: Bus. Process. Manag. J. 30(1), pp. 183-198, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
39 | Cut Alna Fadhilla, Muhammad Dany Alfikri, Rafael Kaliski |
Lightweight Meta-Learning BotNet Attack Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Internet Things J. ![In: IEEE Internet Things J. 10(10), pp. 8455-8466, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
39 | Zamzami Zainuddin, Ratna Farida, Cut Muftia Keumala, Rudi Kurniawan, Hadi Iskandar |
Synchronous online flip learning with formative gamification quiz: instruction during COVID-19. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Interact. Technol. Smart Educ. ![In: Interact. Technol. Smart Educ. 19(2), pp. 236-259, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
39 | Kharis Kharis, Cut Nyak Dameria, Martin Ebner |
Perception and Acceptance of Padlet as a Microblogging Platform for Writing Skills. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Interact. Mob. Technol. ![In: Int. J. Interact. Mob. Technol. 14(13), pp. 213-220, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
39 | Zamzami Zainuddin, Yin Zhang, Xiuhan Li, Samuel Kai-Wah Chu, Saifullah Idris, Cut Muftia Keumala |
Research trends in flipped classroom empirical evidence from 2017 to 2018. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Interact. Technol. Smart Educ. ![In: Interact. Technol. Smart Educ. 16(3), pp. 255-277, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
39 | Cut Maisyarah Karyati, Aries Muslim, Daryl Diningrat |
3D Saliva Ferning Images to Determine The Women's Fertility Rates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICVIP ![In: ICVIP 2019: The 3rd International Conference on Video and Image Processing, Shanghai, China, December 20-23, 2019, pp. 239-244, 2019, ACM, 978-1-4503-7682-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
39 | Amin Subandi, Rini Meiyanti, Cut Lika Mestika Sandy, Rahmat Widia Sembiring |
Three-Pass Protocol Implementation in Vigenere Cipher Classic Cryptography Algorithm with Keystream Generator Modification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.01609, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
39 | Chenghao Li 0004, Yuan Zhou 0006, Bo Cut, Chunping Hou |
Depth-weighted correlation method for visual tracking with occlusion detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: 2017 IEEE International Conference on Image Processing, ICIP 2017, Beijing, China, September 17-20, 2017, pp. 3660-3664, 2017, IEEE, 978-1-5090-2175-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Aries Muslim, A. B. Mutiara 0001, Cut Maisyarah Karyati, Purnawarman Musa |
An Algorithm for Index Multimedia Data (Video) using the Movement Oriented Method for Real-time Online Services ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1003.3080, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
38 | Jue Wang 0001, Pravin Bhat, Alex Colburn, Maneesh Agrawala, Michael F. Cohen |
Interactive video cutout. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 24(3), pp. 585-594, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
alpha matting, interactive video processing, mean-shift segmentation, graph-cut, min-cut |
38 | Jin-Tai Yan |
Connection-oriented net model and fuzzy clustering techniques for K-way circuit partitioning. ![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. 236-241, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
fuzzy neural nets, connection-oriented net model, fuzzy clustering techniques, K-way circuit partitioning, chain net model, cut analysis, multiple-pin net, edge-weighted graph, MCNC circuit benchmarks, partitioning balance, partitioning cut, computational complexity, complexity, fuzzy logic, high level synthesis, circuit analysis computing, hypergraph, fuzzy c-means clustering, mapped graph, fuzzy memberships |
37 | Hongwei Liu 0001, Sanyang Liu, Fengmin Xu |
A Tight Semidefinite Relaxation of the MAX CUT Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(3), pp. 237-245, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
semidefinite relaxation, cut polytope, metric polytope, MAX CUT problem |
Displaying result #1 - #100 of 8499 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|