|
|
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 |
36 | Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi |
On partitioning graphs via single commodity flows. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
edge-separator, single-commodity max-flow, graph partitioning, spectral method, sparsest cut, matrix exponential |
36 | Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh |
Compacting cuts: A new linear formulation for minimum cut. |
ACM Trans. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Linear programming formulation complexity, minimum cut problem |
36 | Zhi-Quan Cheng, Bao Li 0002, Gang Dang, Shiyao Jin |
Meaningful Mesh Segmentation Guided by the 3D Short-Cut Rule. |
GMP |
2008 |
DBLP DOI BibTeX RDF |
Meaningful mesh segmentation, 3D short-cut rule, minimal-rule, skeleton |
36 | Kentaro Kikuchi |
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
?-calculus, Sequent calculus, Cut-elimination, Confluence, Explicit substitution |
36 | Kai Brünnler |
Cut Elimination inside a Deep Inference System for Classical Predicate Logic. |
Stud Logica |
2006 |
DBLP DOI BibTeX RDF |
cut elimination, first-order predicate logic, deep inference |
36 | Sylvain Paris, François X. Sillion, Long Quan |
A Surface Reconstruction Method Using Global Graph Cut Optimization. |
Int. J. Comput. Vis. |
2006 |
DBLP DOI BibTeX RDF |
graph flow, 3D reconstruction from calibrated cameras, occlusions, graph cut, discontinuities, global minimum, self-occlusions |
36 | Songshan Guo, Weixing Li, Andrew Lim 0001, Fan Wang 0003 |
The shortest route cut and fill problem in linear topological structure. |
SAC |
2005 |
DBLP DOI BibTeX RDF |
cut and fill, optimization |
36 | Jens Lysgaard, Adam N. Letchford, Richard W. Eglese |
A new branch-and-cut algorithm for the capacitated vehicle routing problem. |
Math. Program. |
2004 |
DBLP DOI BibTeX RDF |
separation, vehicle routing, branch-and-cut |
36 | Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners |
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
semidefiniteprogramming, Lovász -function, MAX-k-CUT, approximation algorithms, satisfiability, graph colouring |
36 | Francisco Gutiérrez, Blas C. Ruiz |
A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene. |
LOPSTR |
2002 |
DBLP DOI BibTeX RDF |
lambda calculus with types, pure type systems, cut elimination, sequent calculi |
36 | Wenjian Qiao, Lionel M. Ni, Tomas Rokicki |
Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches. |
IEEE Trans. Parallel Distributed Syst. |
1999 |
DBLP DOI BibTeX RDF |
incremental scalability, performance evaluation, Adaptive routing, deadlock-free routing, irregular networks, cut-through switches |
36 | Mingyao Yang, Lionel M. Ni |
Design of Scalable and Multicast Capable Cut-Through Switches for High-Speed LANs. |
ICPP |
1997 |
DBLP DOI BibTeX RDF |
Intra-switch interconnect, Switch packaging, Multicast, Deadlock-free routing, Switch architecture, Cut-through switching |
36 | Ken Yocum, Jeffrey S. Chase, Andrew J. Gallatin, Alvin R. Lebeck |
Cut-Through Delivery in Trapeze: An Exercise in Low-Latency Messaging. |
HPDC |
1997 |
DBLP DOI BibTeX RDF |
message switching, cut-through delivery, low-latency messaging, I/O bus bandwidths, host I/O DMA transfers, network traversal, messaging substrate, network memory, Trapeze prototype, virtual memory pages, Myrinet cluster, DEC AlphaStations, network interfaces, computer clusters, network technology, application performance, messaging systems |
36 | Jaekyu Ha, Robert M. Haralick, Ihsin T. Phillips |
Recursive X-Y cut using bounding boxes of connected components. |
ICDAR |
1995 |
DBLP DOI BibTeX RDF |
recursive X-Y cut, top-down page segmentation technique, rectangular blocks, Sparc-10 workstations, letter-sized document images, image segmentation, document image processing, connected components, document image, bounding boxes, image pixels |
35 | Martin Gruber, Günther R. Raidl |
Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. |
SAINT |
2008 |
DBLP DOI BibTeX RDF |
bounded diameter minimum spanning tree, local search, tabu search, branch-and-cut |
35 | Clément Houtmann |
Axiom Directed Focusing. |
TYPES |
2008 |
DBLP DOI BibTeX RDF |
superdeduction, Proof theory, focusing, deduction modulo |
35 | Monika Rauch Henzinger |
Approximating Minimum Cuts under Insertions. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
34 | Peng Zhang 0008, Jin-yi Cai, Linqing Tang, Wenbo Zhao 0001 |
Approximation and Hardness Results for Label Cut and Related Problems. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Giuseppe Patanè 0001, Michela Spagnuolo, Bianca Falcidieno |
Topological Generators and Cut-Graphs of Arbitrary Triangle Meshes. |
Shape Modeling International |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Michael Felsberg |
Extending Graph-Cut to Continuous Value Domain Minimization. |
CRV |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Chao Wang, Qiong Yang, Mo Chen, Xiaoou Tang, Zhongfu Ye |
Progressive cut. |
ACM Multimedia |
2006 |
DBLP DOI BibTeX RDF |
graph cuts, interactive image segmentation, foreground extraction, user attention |
34 | James R. Lee |
On distance scales, embeddings, and efficient relaxations of the cut cone. |
SODA |
2005 |
DBLP BibTeX RDF |
|
34 | Viswanath Nagarajan, R. Ravi 0001 |
Approximation Algorithms for Requirement Cut on Graphs. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Adi Avidor, Michael Langberg |
The Multi-multiway Cut Problem. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Sanjeeb Dash |
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. |
IPCO |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Uriel Feige, Gideon Schechtman |
On the integrality ratio of semidefinite relaxations of MAX CUT. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Michel X. Goemans, David P. Williamson |
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Mikkel Thorup |
Fully-dynamic min-cut. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
34 | José Espírito Santo |
Revisiting the Correspondence between Cut Elimination and Normalisation. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
34 | Friedhelm Meyer auf der Heide, Gabriel Terán Martinez |
Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation. |
LATIN |
1998 |
DBLP DOI BibTeX RDF |
|
34 | Pak K. Chan, Martine D. F. Schlag, Jason Y. Zien |
Spectral K-way ratio-cut partitioning and clustering. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Kim Taylor |
The Role of Inhibition on Asynchronous Consistent-Cut Protocols. |
WDAG |
1989 |
DBLP DOI BibTeX RDF |
|
34 | Alberto Martelli |
A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph. |
J. ACM |
1976 |
DBLP DOI BibTeX RDF |
|
34 | Inderpal S. Bhandari, Mark Hirsch, Daniel P. Siewiorek |
The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement. |
DAC |
1988 |
DBLP BibTeX RDF |
|
33 | Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki |
Greedy splitting algorithms for approximating multiway partition problems. |
Math. Program. |
2005 |
DBLP DOI BibTeX RDF |
k-way cut, Multiterminal cut, Multiway partition problem, Approximation algorithm, Submodular function, Hypergraph partition |
33 | Eyal Amir, Robert Krauthgamer, Satish Rao |
Constant factor approximation of vertex-cuts in planar graphs. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
balanced cut, planar separator, quotient cut, vertex separator, approximation algorithms, planar graph |
33 | Arnold Beckmann |
Resolution Refutations and Propositional Proofs with Height-Restrictions. |
CSL |
2002 |
DBLP DOI BibTeX RDF |
Height of proofs, Length of proofs, Resolution refutation, Frege systems, Order induction principle, Cut introduction, MSC: Primary 03F20, Secondary 03F07, 68R99, Cut elimination, 68Q15, Bounded arithmetic, Propositional calculus |
33 | Khushro Shahookar, Pinaki Mazumder |
Genetic multiway partitioning. |
VLSI Design |
1995 |
DBLP DOI BibTeX RDF |
genetic multiway partitioning, result quality, binary chromosome, bit-mask operations, net cut evaluation, MCNC benchmark circuits, cut size, genetic algorithms, VLSI, VLSI, CAD, software tools, software tool, logic CAD, mutation, circuit CAD, crossover, cellular arrays, cost function, circuit optimisation, logic partitioning, multiple objectives, bipartitioning |
31 | Fuxiang Yu |
On the Representations of NC and Log-Space Real Numbers. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
representations of real numbers, Cauchy function, left cut, P, Log-space, Complexity, expressive power, NC |
31 | Daya Ram Gaur, Ramesh Krishnamurti |
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
hypergraph 2-colorability, set splitting, maxnaesp, approximation algorithms, max-cut |
31 | Jianmin Li, John Lillis, Chung-Kuan Cheng |
Linear decomposition algorithm for VLSI design applications. |
ICCAD |
1995 |
DBLP DOI BibTeX RDF |
linear placement, max-flow min-cut, eigenvector, circuit partitioning |
31 | Timo Kötzing, Per Kristian Lehre, Frank Neumann 0001, Pietro S. Oliveto |
Ant colony optimization and the minimum cut problem. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
ant colony optimization, min-cut |
31 | Hugo Herbelin, Gyesik Lee |
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus. |
WoLLIC |
2009 |
DBLP DOI BibTeX RDF |
Intuitionistic Gentzen-style sequent calculus, completeness, cut-elimination, Kripke semantics |
31 | Steven Brown, Bryan S. Morse, William A. Barrett |
Interactive part selection for mesh and point models using hierarchical graph-cut partitioning. |
Graphics Interface |
2009 |
DBLP BibTeX RDF |
interactive modeling tools, model partitioning, scribble interface, mesh, graph cut, point set |
31 | Luca Trevisan |
Max cut and the smallest eigenvalue. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
maximum cut, spectral partitioning |
31 | Harshavardhan Chenji, Prabir Barooah, Radu Stoleru, Tamás Kalmár-Nagy |
Distributed cut detection in sensor networks. |
SenSys |
2008 |
DBLP DOI BibTeX RDF |
distributed cut detection, wireless sensor networks |
31 | Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin 0001 |
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
Branch and cut algorithms, semidefinite programs, polyhedral combinatorics, cutting plane algorithms |
31 | Yunbo Cao, Huizhong Duan, Chin-Yew Lin, Yong Yu 0001, Hsiao-Wuen Hon |
Recommending questions using the mdl-based tree cut model. |
WWW |
2008 |
DBLP DOI BibTeX RDF |
question recommendation, tree cut model, minimum description length, query suggestion |
31 | Reid Kerr, Wolfgang Stürzlinger |
Context-sensitive cut, copy, and paste. |
C3S2E |
2008 |
DBLP DOI BibTeX RDF |
code development, context sensitive code, development environment, cut, copy, programming errors, paste |
31 | Oyunchimeg Shagdar, Suhua Tang, Mehdad N. Shirazi, Ryutaro Suzuki, Sadao Obana |
Reliable cut-through forwarding in CDMA inter-vehicle networks. |
ICUIMC |
2008 |
DBLP DOI BibTeX RDF |
collision warning, cut-through forwarding, diversity combining, inter-vehicle networks, CDMA |
31 | Paul Congdon, Matthew K. Farrens, Prasant Mohapatra |
Packet prediction for speculative cut-through switching. |
ANCS |
2008 |
DBLP DOI BibTeX RDF |
cut-through, ethernet switching, packet prediction, speculation |
31 | Guillaume Burel, Claude Kirchner |
Cut Elimination in Deduction Modulo by Abstract Completion. |
LFCS |
2007 |
DBLP DOI BibTeX RDF |
Knuth-Bendix completion, automated deduction and interactive theorem proving, proof ordering, abstract canonical system, cut elimination, deduction modulo |
31 | Ted K. Ralphs, Matthew V. Galati |
Decomposition and Dynamic Cut Generation in Integer Linear Programming. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
Integer Programming, Lagrangian Relaxation, Branch and Cut, Decomposition Algorithms, Branch and Price, Dantzig-Wolfe Decomposition |
31 | Sebastian Niezgoda, Thomas P. Way |
SNITCH: a software tool for detecting cut and paste plagiarism. |
SIGCSE |
2006 |
DBLP DOI BibTeX RDF |
automated grading tools, cut and paste plagiarism, ethics, cheating, plagiarism detection |
31 | Yongbing Zhang, Xiangyang Ji, Debin Zhao, Wen Gao 0001 |
Video Coding by Texture Analysis and Synthesis Using Graph Cut. |
PCM |
2006 |
DBLP DOI BibTeX RDF |
optimal seam, texture, video coding, graph cut, analysis and synthesis |
31 | Xiaohong Jiang 0002, Fen Dai, Hanqing Jiang |
An Experimental Facial Synthesis System Using Graph Cut and Gradient Domain Fusion. |
Edutainment |
2006 |
DBLP DOI BibTeX RDF |
Objective stroke, Background stroke, Automatic region selection, Gradient domain fusion, Energy minimization, Graph cut, K-means clustering |
31 | Abilio Lucena |
Non Delayed Relax-and-Cut Algorithms. |
Ann. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
relax-and-cut, valid constraints, dual bound strengthening, Lagrangian relaxation |
31 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Unrestricted vs restricted cut in a tableau method for Boolean circuits. |
Ann. Math. Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
cut rule, satisfiability, proof complexity, Boolean circuits, DPLL |
31 | Katalin Bimbó |
Admissibility of Cut in LC with Fixed Point Combinator. |
Stud Logica |
2005 |
DBLP DOI BibTeX RDF |
structurally free logics, fked point combinator, (multiple) cut rule, elimination theorem, substructural logics, non-classical logics, combinatory logic |
31 | Yin Li, Jian Sun 0001, Heung-Yeung Shum |
Video object cut and paste. |
ACM Trans. Graph. |
2005 |
DBLP DOI BibTeX RDF |
tracking, graph cut, video segmentation, matting |
31 | Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene |
Monadic augment and generalised short cut fusion. |
ICFP |
2005 |
DBLP DOI BibTeX RDF |
short cut fusion, monads, bind, build, augment |
31 | Yichen Wei, Long Quan |
Asymmetrical Occlusion Handling Using Graph Cut for Multi-View Stereo. |
CVPR (2) |
2005 |
DBLP DOI BibTeX RDF |
occlusion, stereo, graph cut |
31 | Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev |
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
directed balanced separator, directed sparsest cut, min 2CNF deletion, min UnCut, min multicut |
31 | Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykumar |
Min-cut program decomposition for thread-level speculation. |
PLDI |
2004 |
DBLP DOI BibTeX RDF |
partitioning, chip multiprocessor, thread-level speculation, min-cut, program decomposition |
31 | Noga Alon, Assaf Naor |
Approximating the cut-norm via Grothendieck's inequality. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
Grothendieck's inequaity, cut-norm, rounding techniques |
31 | Andrew B. Kahng, Sherief Reda |
Placement feedback: a concept and method for better min-cut placements. |
DAC |
2004 |
DBLP DOI BibTeX RDF |
min-cut placement, terminal propagation, feedback |
31 | Yoshinao Takemae, Kazuhiro Otsuka, Naoki Mukawa |
Video cut editing rule based on participants' gaze in multiparty conversation. |
ACM Multimedia |
2003 |
DBLP DOI BibTeX RDF |
recording meetings, video cut editing, teleconferencing, gaze, multiple cameras, multiparty conversation |
31 | Luigi Di Lascio |
Hilbertian systems, analytic fuzzy tableaux and cut rule elimination in rational pavelka logic. |
SEKE |
2002 |
DBLP DOI BibTeX RDF |
cut rule, fuzzy prepositional logic, galois relation, pavelka semantics, completeness, soundness, MV-algebra, tableaux |
31 | Chris Jermaine |
Computing Program Modularizations Using the k-Cut Method. |
WCRE |
1999 |
DBLP DOI BibTeX RDF |
k-cut, reverse engineering, module |
31 | Frank Vahid |
Modifying Min-Cut for Hardware and Software Functional Partitioning. |
CODES |
1997 |
DBLP DOI BibTeX RDF |
Kernighan/Lin, min-cut, Functional partitioning |
31 | Péter Kacsuk |
Dataflow model for handling cut in the LOGFLOW parallel prolog machine. |
PDP |
1995 |
DBLP DOI BibTeX RDF |
parallel prolog machine, Logicflow Model, Generalized Dataflow Model, GDM, node types, logic programming, logic programs, PROLOG, distributed memory systems, distributed memory, CUT, data flow computing |
30 | Florent Cadoux |
Computing deep facet-defining disjunctive cuts for mixed-integer programming. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C10 |
30 | David Pritchard |
Fast Distributed Computation of Cuts Via Random Circulations. |
ICALP (1) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Joachim Baran, Howard Barringer |
Forays into Sequential Composition and Concatenation in Eagle. |
RV |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Yunnan Wu, Kamal Jain, Sun-Yuan Kung |
A unification of network coding and tree-packing (routing) theorems. |
IEEE Trans. Inf. Theory |
2006 |
DBLP DOI BibTeX RDF |
routing, multicast, network coding, steiner tree, flow |
30 | John Moondanos, Carl-Johan H. Seger, Ziyad Hanna, Daher Kaiss |
CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination. |
CAV |
2001 |
DBLP DOI BibTeX RDF |
|
30 | András A. Benczúr, Ottilia Fülöp |
Fast Algorithms for Even/Odd Minimum Cuts and Generalizations. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Franz Rendl, Giovanni Rinaldi, Angelika Wiegele |
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C20, 90C27, 90C22 |
29 | Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy |
Sparse Cut Projections in Graph Streams. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Stephen R. Tate, Roopa Vishwanathan |
Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols Using Trusted Computing Technology. (PDF / PS) |
DBSec |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Dirk Pattinson, Lutz Schröder |
Generic Modal Cut Elimination Applied to Conditional Logics. |
TABLEAUX |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Linlin Shui, Minyong Shi, Weiguo Lin, Jianxiang Cao |
A Chinese Paper Cut-out System Based on Decorative Pattern Recognition. |
ICYCS |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Tobi Vaudrey, Daniel Gruber, Andreas Wedel, Jens Klappstein |
Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation. |
DAGM-Symposium |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Xiaoqing Liu, Olga Veksler, Jagath Samarabandu |
Graph cut with ordering constraints on labels and its applications. |
CVPR |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Jingfu Liu |
Development of Paper-Cut Animation for M-learning from Cultural Perspective. |
CSSE (5) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Olga Veksler |
Star Shape Prior for Graph-Cut Image Segmentation. |
ECCV (3) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Gilles Dowek, Olivier Hermant |
A Simple Proof That Super-Consistency Implies Cut Elimination. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Oguzhan Urhan, M. Kemal Güllü, Sarp Ertürk |
Modified phase-correlation based robust hard-cut detection with application to archive film. |
IEEE Trans. Circuits Syst. Video Technol. |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Josep Díaz, Fabrizio Grandoni 0001, Alberto Marchetti-Spaccamela |
Balanced Cut Approximation in Random Geometric Graphs. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Jian Sun 0001, Weiwei Zhang, Xiaoou Tang, Heung-Yeung Shum |
Background Cut. |
ECCV (2) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Yuri Boykov, Vladimir Kolmogorov |
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier |
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. |
WEA |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Karlis Freivalds |
A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning. |
WEA |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Harry G. Mairson, Kazushige Terui |
On the Computational Complexity of Cut-Elimination in Linear Logic. |
ICTCS |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Philipp Gerhardy |
Refined Complexity Analysis of Cut Elimination. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Wai-Kei Mak |
Min-cut partitioning with functional replication fortechnology-mapped circuits using minimum area overhead. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Michael Lewin, Dror Livnat, Uri Zwick |
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. |
IPCO |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Matthias Baaz, Agata Ciabattoni |
A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic. |
TABLEAUX |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Ishai Menache, Shie Mannor, Nahum Shimkin |
Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning. |
ECML |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Eran Halperin, Uri Zwick |
Combinatorial approximation algorithms for the maximum directed cut problem. |
SODA |
2001 |
DBLP BibTeX RDF |
|
Displaying result #101 - #200 of 8499 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|