Search results for "$k$-Cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
29	Glen A. Wallace, Robert Biddle, Ewan D. Tempero	Smarter Cut-and-Paste for Programming Text Editors.	AUIC	2001	DBLP DOI BibTeX RDF
29	Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.	Branch, Cut, and Price: Sequential and Parallel.	Computational Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
29	Patricia Johann	Short Cut Fusion: Proved and Improved.	SAIG	2001	DBLP DOI BibTeX RDF
29	Jin-Tai Yan	An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1999	DBLP DOI BibTeX RDF
29	Satoru Iwata 0001, S. Thomas McCormick, Maiko Shigeno	A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.	IPCO	1999	DBLP DOI BibTeX RDF
29	Christian Urban, Gavin M. Bierman	Strong Normalisation of Cut-Elimination in Classical Logic.	TLCA	1999	DBLP DOI BibTeX RDF
29	Olaf Chitil	Type Inference Builds a Short Cut to Deforestation.	ICFP	1999	DBLP DOI BibTeX RDF
29	L. James Hwang, Abbas El Gamal	Min-cut replication in partitioned networks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1995	DBLP DOI BibTeX RDF
29	Bo Yu 0001, Joseph Cheriyan	Approximation Algorithms for Feasible Cut and Multicut Problems.	ESA	1995	DBLP DOI BibTeX RDF
29	Gilberto Filé, Sabina Rossi	Static Analysis of Prolog with Cut.	LPAR	1993	DBLP DOI BibTeX RDF
29	Luís Pinto 0001	Cut Formulae and Logic Programming.	ELP	1993	DBLP DOI BibTeX RDF
29	Jianxiu Hao, James B. Orlin	A Faster Algorithm for Finding the Minimum Cut in a Graph.	SODA	1992	DBLP BibTeX RDF
29	Yen-Chuen A. Wei, Chung-Kuan Cheng	Ratio cut partitioning for hierarchical designs.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1991	DBLP DOI BibTeX RDF
29	Ted H. Szymanski, Chien Fang	Design and analysis of buffered crossbars and banyans with cut-through switching.	SC	1990	DBLP DOI BibTeX RDF
29	John H. Reif	Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time.	ICALP	1981	DBLP DOI BibTeX RDF
28	Fulong Yu, Vijay G. Sankaran, Guo-Cheng Yuan	CUT&RUNTools 2.0: a pipeline for single-cell and bulk-level CUT&RUN and CUT&Tag data analysis.	Bioinform.	2021	DBLP DOI BibTeX RDF
28	Audrey Cerqueus	Bi-objective branch-and-cut algorithms applied to the binary knapsack problem : surrogate upper bound sets, dynamic branching strategies, generation and exploitation of cover inequalities. (Algorithmes de branch-and-cut bi-objectif appliqués au problème du sac-à-dos en variables binaires / Algorithmes de branch-and-cut bi-objectif appliqués au problème du sac-à-dos en variables binaires : ensembles bornants surrogate, stratégies de branchement dynamiques, génération et exploitation d'inégalités de couverture).		2015	RDF
28	Tanja Hartmann	Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering.		2014	RDF
28	Kang Li, Xiaodong Wu 0001, Danny Z. Chen, Milan Sonka	Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach.	IEEE Trans. Pattern Anal. Mach. Intell.	2006	DBLP DOI BibTeX RDF	Optimal surface, minimum s{hbox{-}} t cut, graph algorithms, graph cut, geometric constraint, medical image segmentation
28	Arnold Neumaier, Oleg Shcherbina	Safe bounds in linear and mixed-integer linear programming.	Math. Program.	2004	DBLP DOI BibTeX RDF	directed rounding, mixed-integer rounding, generalized Gomory cut, safe cuts, safe presolve, certificate of infeasibility, lower bounds, linear programming, mixed-integer programming, interval arithmetic, branch-and-cut, rounding errors
26	Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi	Packrat parsers can handle practical grammars in mostly constant space.	PASTE	2010	DBLP DOI BibTeX RDF	cut operators, packrat parsing, parsing expression grammars, backtracking, memoization, parser generator
26	Christoph Buchheim, Frauke Liers, Marcus Oswald	A Basic Toolbox for Constrained Quadratic 0/1 Optimization.	WEA	2008	DBLP DOI BibTeX RDF	maximum cut problem, local cuts, similar subgraphs, quadratic programming, crossing minimization
26	Xijin Yan, Jun Yang, Zhen Zhang 0010	An outer bound for multisource multisink network coding with minimum cost consideration.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	K-pairs transmission, max-flow min-cut bound, multisource multisink network, network sharing bound, three-layer network, network coding, side information
26	Andrei Sharf, Marina Blumenkrants, Ariel Shamir, Daniel Cohen-Or	SnapPaste: an interactive technique for easy mesh composition.	Vis. Comput.	2006	DBLP DOI BibTeX RDF	User-interface, Meshes, Interactive tools, Snapping, Cut-and-paste
26	C. Weliwitage, A. L. Harvey, Andrew B. Jennings	Handwritten Document Offline Text Line Segmentation.	DICTA	2005	DBLP DOI BibTeX RDF	cut text minimisation, text line segmentation, handwriting, offline
26	Ismael R. de Farias Jr.	Semi-continuous Cuts for Mixed-Integer Programming.	IPCO	2004	DBLP DOI BibTeX RDF	semi-continuous variables, mixed-integer programming, branch-and-cut, polyhedral combinatorics, disjunctive programming
26	Grace SauLan Loo, Kok-Huat Lee	An Interface to Databases for Flexible Query Answering: A Fuzzy-Set Approach.	DEXA	2000	DBLP DOI BibTeX RDF	alpha-cut, design, interface, approximate, flexibility, fuzzy, linguistic, imprecise, query modification
26	David Sedlácek, Jiri Zara	Graph Cut Based Point-Cloud Segmentation for Polygonal Reconstruction.	ISVC (2)	2009	DBLP DOI BibTeX RDF	terrain reconstruction, Langweil model, segmentation, graph cut, point-cloud
26	Emely Arráiz, Oswaldo Olivo	Competitive simulated annealing and Tabu Search algorithms for the max-cut problem.	GECCO	2009	DBLP DOI BibTeX RDF	algorithms, simulated annealing, Tabu Search, metaheuristic, max-cut
26	Chen Liu, Fengxia Li, Yan Zhang, Haiyang Gu	Interactive Image Segmentation Based on Hierarchical Graph-Cut Optimization with Generic Shape Prior.	ICIAR	2009	DBLP DOI BibTeX RDF	shape prior knowledge, Image segmentation, graph cut
26	Shuchi Chawla 0001, Anupam Gupta 0001, Harald Räcke	Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	negative-type metric, Approximation algorithm, metrics, embedding, sparsest cut
26	April K. Andreas, J. Cole Smith, Simge Küçükyavuz	Branch-and-price-and-cut algorithms for solving the reliable h -paths problem.	J. Glob. Optim.	2008	DBLP DOI BibTeX RDF	Branch-and-price-and-cut, Reliability, Network optimization, Nonconvex optimization
26	Klaus Aehlig, Arnold Beckmann	On the Computational Complexity of Cut-Reduction.	LICS	2008	DBLP DOI BibTeX RDF	cut-reduction, proof notations, propositional logic, Bounded Arithmetic
26	Olivier Laurent 0001, Roberto Maieli	Cut Elimination for Monomial MALL Proof Nets.	LICS	2008	DBLP DOI BibTeX RDF	Linear Logic, Cut Elimination, Proof Net
26	Sayaka Ooshima, Yuki Hashimoto, Hideyuki Ando, Junji Watanabe, Hiroyuki Kajimoto	Simultaneous Presentation of Tactile and Auditory Motion on the Abdomen to Realize the Experience of "Being Cut by a Sword".	EuroHaptics	2008	DBLP DOI BibTeX RDF	Fusion of Hapitc and Sound, Apparent Movement, Being Cut by a Sword, Haptic Display
26	Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz 0002	Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling.	STOC	2008	DBLP DOI BibTeX RDF	linear and semidefinite programming, metric labelling, multiway cut, integrality gaps, unique games conjecture
26	Pietro Belotti, Martine Labbé, Francesco Maffioli, Malick M. Ndiaye	A branch-and-cut method for the obnoxious p -median problem.	4OR	2007	DBLP DOI BibTeX RDF	Obnoxious facility location, Branch-and-cut, p-Median
26	Elena Casiraghi, Gabriele Lombardi, Stella Pratissoli, Simone Rizzi	3D alpha -Expansion and Graph Cut Algorithms for Automatic Liver Segmentation from CT Images.	KES (1)	2007	DBLP DOI BibTeX RDF	Liver Segmentation, ?-expansion, graph-cut algorithm, energy minimization, Computed Tomography
26	Sandberg Marcel Santos, Díbio Leandro Borges, Herman Martins Gomes	An Evaluation of Video Cut Detection Techniques.	CIARP	2007	DBLP DOI BibTeX RDF	video cut detection, visual rhythm, pixel differentiation, video summarization, color histograms
26	Bratislav Milic, Miroslaw Malek	Adaptation of the breadth first search algorithm for cut-edge detection in wireless multihop networks.	MSWiM	2007	DBLP DOI BibTeX RDF	cut-edge detection, real network analysis, wireless multihop networks
26	Eng-Wee Chionh	The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports.	ASCM	2007	DBLP DOI BibTeX RDF	Dixon matrix, corner-cut monomial supports, mechanical proof, maximality
26	Amit Agarwal, Noga Alon, Moses Charikar	Improved approximation for directed cut problems.	STOC	2007	DBLP DOI BibTeX RDF	directed multicut, directed sparsest cut, approximation algorithm, linear programming relaxation
26	Bako Rajaonah, Françoise Anceaux, Fabrice Vienne	Trust and the use of adaptive cruise control: a study of a cut-in situation.	Cogn. Technol. Work.	2006	DBLP DOI BibTeX RDF	Adaptive cruise control, Cut-in-situation, Trust, Questionnaire, Driving simulator
26	Agata Ciabattoni, Kazushige Terui	Towards a Semantic Characterization of Cut-Elimination.	Stud Logica	2006	DBLP DOI BibTeX RDF	nonclassical logicss, phase semantics, sequent calculus, cut-elimination, substructural logics
26	Anna Zamansky, Arnon Avron	Cut-Elimination and Quantification in Canonical Systems.	Stud Logica	2006	DBLP DOI BibTeX RDF	canonical systems, proof theory, cut elimination, non-deterministic matrices
26	Grigori Mints	Cut Elimination for S4C: A Case Study.	Stud Logica	2006	DBLP DOI BibTeX RDF	Dynamic topological logic, cut elimination
26	Yongpei Guan, Shabbir Ahmed 0001, George L. Nemhauser, Andrew J. Miller	A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Stochastic Lot-Sizing, Multi-stage Stochastic Integer Programming, Polyhedral Study, Branch-and-Cut
26	Suvrajeet Sen, Hanif D. Sherali	Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming.	Math. Program.	2006	DBLP DOI BibTeX RDF	Decomposition, Stochastic Programming, Mixed-Integer Programming, Branch-and-Cut
26	Sven Fleck, Florian Busch, Peter Biber, Wolfgang Straßer	Graph Cut based Panoramic 3D Modeling and Ground Truth Comparison with a Mobile Platform - The Wagele -.	CRV	2006	DBLP DOI BibTeX RDF	3D model acquisition, Graph Cut, 3DTV
26	Manfred Padberg	Classical Cuts for Mixed-Integer Programming and Branch-and-Cut.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	Gomory cuts, mixed-integer programming, branch-and-cut, cutting planes
26	Tamás Kis	A branch-and-cut algorithm for scheduling of projects with variable-intensity activities.	Math. Program.	2005	DBLP DOI BibTeX RDF	Network flows, Branch-and-cut, Project scheduling, Polyhedral combinatorics
26	Martine Labbé, Hande Yaman, Éric Gourdin	A branch and cut algorithm for hub location problems with single assignment.	Math. Program.	2005	DBLP DOI BibTeX RDF	Hub location, Polyhedral analysis, Branch and cut
26	Md. Altaf-Ul-Amin, Toshihiro Koma, Ken Kurokawa, Shigehiko Kanaya	Prediction of Protein Functions Based on Protein-Protein Interaction Networks: A Min-Cut Approach.	ICDE Workshops	2005	DBLP DOI BibTeX RDF	heuristic method, min-cut, protein function prediction, protein-protein interaction network
26	Abraham Duarte, Ángel Sánchez, Felipe Fernández, Raúl Cabido	A low-level hybridization between memetic algorithm and VNS for the max-cut problem.	GECCO	2005	DBLP DOI BibTeX RDF	evolutionary algorithms, metaheuristic, memetic algorithms, max-cut, VNS
26	Sanjeev Arora, James R. Lee, Assaf Naor	Euclidean distortion and the sparsest cut.	STOC	2005	DBLP DOI BibTeX RDF	approximation algorithms, semidefinite programming, metric embeddings, sparsest cut
26	Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S. Mukherjee	BLAM : A High-Performance Routing Algorithm for Virtual Cut-Through Networks.	IPDPS	2003	DBLP DOI BibTeX RDF	non-minimal routing, chaotic routing, Multiprocessor interconnection networks, routing algorithm, k-ary n-cubes, virtual cut-through
26	Ram Kesavan, Dhabaleswar K. Panda 0001	Efficient Multicast on Irregular Switch-Based Cut-Through Networks with Up-Down Routing.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	cut-through routing, multicast, broadcast, wormhole routing, collective communication, networks of workstations, Parallel computer architecture, irregular networks, switch-based networks
26	Yufei Guo, Sajal K. Das 0001, Maria Cristina Pinotti	A new hybrid broadcast scheduling algorithm for asymmetric communication systems: push and pull data based on optimal cut-off point.	MSWiM	2001	DBLP DOI BibTeX RDF	asymmetric communication systems, cut-off point, pull-based scheduling, push-based scheduling, hybrid algorithm, broadcast scheduling
26	Mechthild Stoer, Frank Wagner 0001	A simple min-cut algorithm.	J. ACM	1997	DBLP DOI BibTeX RDF	min-cut
26	José Duato	A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	interconnection networks, design methodologies, Adaptive routing, deadlock avoidance, virtual cut-through, store-and-forward
26	Jin-Tai Yan	An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering.	ICCD	1995	DBLP DOI BibTeX RDF	cut-based algorithm, L-shaped channels, safe routing ordering, geometrical topology, floorplan graph, channel precedence graph, S-cuts, redundant L-cuts, balanced L-cuts, non-minimal L-cuts, non-critical L-cuts, critical L-cuts, computational complexity, time complexity, circuit layout CAD, line segments, precedence relations
25	Youssef Hanna, Samik Basu 0001, Hridesh Rajan	Behavioral automata composition for automatic topology independent verification of parameterized systems.	ESEC/SIGSOFT FSE	2009	DBLP DOI BibTeX RDF	parameterized model checking
25	Shamima Yasmin, Abdullah Zawawi Talib	A New Approach for Surface Reconstruction Using Slices.	ICCS (2)	2009	DBLP DOI BibTeX RDF	Surface Reconstruction, Contours, Boundary
25	Brian C. Dean, Adam Griffis, Adam A. Whitley	Approximation Algorithms for k-Hurdle Problems.	LATIN	2008	DBLP DOI BibTeX RDF
25	Alan Mishchenko, Satrajit Chatterjee, Robert K. Brayton	Improvements to Technology Mapping for LUT-Based FPGAs.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2007	DBLP DOI BibTeX RDF
25	Abbas El Gamal, Navid Hassanpour, James P. Mammen	Relay Networks With Delays.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
25	Jekeon Jack Cha, Shahram Payandeh	Interactive Cross Cutting.	ICRA	2007	DBLP DOI BibTeX RDF
25	Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman	Single source multiroute flows and cuts on uniform capacity networks.	SODA	2007	DBLP BibTeX RDF
25	Phuong Nguyen	Separating DAG-Like and Tree-Like Proof Systems.	LICS	2007	DBLP DOI BibTeX RDF
25	Reid Andersen, Fan R. K. Chung	Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm.	TAMC	2007	DBLP DOI BibTeX RDF
25	Ping-Lang Yen, Cheng-Hsin Liu	Impedance force control for lateral milling of bone in total knee arthroplasty.	SMC	2007	DBLP DOI BibTeX RDF
25	Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang	Optimal 3-terminal cuts and linear programming.	Math. Program.	2006	DBLP DOI BibTeX RDF
25	Subhash Khot, Ryan O'Donnell	SDP gaps and UGC-hardness for MAXCUTGAIN.	FOCS	2006	DBLP DOI BibTeX RDF
25	Reid Andersen, Fan R. K. Chung, Kevin J. Lang	Local Graph Partitioning using PageRank Vectors.	FOCS	2006	DBLP DOI BibTeX RDF
25	D. Barros Júnior, Marcial Jesús Rodríguez-Irago, Marcelino B. Santos, Isabel C. Teixeira, Fabian Vargas 0001, João Paulo Teixeira 0001	Fault Modeling and Simulation of Power Supply Voltage Transients in Digital Systems on a Chip.	J. Electron. Test.	2005	DBLP DOI BibTeX RDF	intermittent faults modeling and simulation, digital SoC, EMI/EMC standard compliance, delay fault simulation, power supply voltage transients, fault tolerance
25	Pooyan Khajehpour Tadavani, Caro Lucas, Babak Nadjar Araabi	Hierarchical Image Segmentation Using Ant Colony and Chemical Computing Approach.	ICNC (2)	2005	DBLP DOI BibTeX RDF
25	Yingyi Chu, Quanshi Xia	Generating Benders Cuts for a General Class of Integer Programming Problems.	CPAIOR	2004	DBLP DOI BibTeX RDF
25	Adrian Barbu, Song Chun Zhu	Multigrid and Multi-Level Swendsen-Wang Cuts for Hierarchic Graph Partition.	CVPR (2)	2004	DBLP DOI BibTeX RDF
25	L. Sunil Chandran, N. S. Narayanaswamy	On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.	COCOON	2004	DBLP DOI BibTeX RDF
25	Tapio Elomaa, Juho Rousu	Necessary and Sufficient Pre-processing in Numerical Range Discretization.	Knowl. Inf. Syst.	2003	DBLP DOI BibTeX RDF	Discretization, Optimal partitioning, Numerical attributes
25	Mirjana Borisavljevic	Two measures for proving Gentzen's Hauptsatz without mix.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF
25	R. Ravi 0001, Amitabh Sinha II	Approximating k-cuts via network strength.	SODA	2002	DBLP BibTeX RDF
25	Hee-Hwan Kwak, In-Ho Moon, James H. Kukula, Thomas R. Shiple	Combinational equivalence checking through function transformation.	ICCAD	2002	DBLP DOI BibTeX RDF	combinational verification, equivalence checking
25	Andrew S. Glassner	A Change of Scene.	IEEE Computer Graphics and Applications	2001	DBLP DOI BibTeX RDF
25	William H. Cunningham, Lawrence Tang	Optimal 3-Terminal Cuts and Linear Programming.	IPCO	1999	DBLP DOI BibTeX RDF
25	Claudia Faggian	Classical Proofs via Basic Logic.	CSL	1997	DBLP DOI BibTeX RDF
25	Torben Braüner, Valeria de Paiva	A Formulation of Linear Logic Based on Dependency-Relations.	CSL	1997	DBLP DOI BibTeX RDF
25	Mark R. Hartoog	Analysis of placement procedures for VLSI standard cell layout.	DAC	1986	DBLP DOI BibTeX RDF
24	Paul Medvedev, Jens Stoye	Rearrangement Models and Single-Cut Operations.	RECOMB-CG	2009	DBLP DOI BibTeX RDF
24	Michele Pagani	The Cut-Elimination Theorem for Differential Nets with Promotion.	TLCA	2009	DBLP DOI BibTeX RDF
24	Arnon Avron, Anna Zamansky	Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination.	LFCS	2009	DBLP DOI BibTeX RDF
24	Maddy Hui Wang, Nilanjan Ray, Hong Zhang 0013	Graph-cut optimization of the ratio of functions and its application to image segmentation.	ICIP	2008	DBLP DOI BibTeX RDF
24	Kentaro Kikuchi, Stéphane Lengrand	Strong Normalisation of Cut-Elimination That Simulates beta-Reduction.	FoSSaCS	2008	DBLP DOI BibTeX RDF
24	Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed	A Continuous Labeling for Multiphase Graph Cut Image Partitioning.	ISVC (1)	2008	DBLP DOI BibTeX RDF
24	Noha Youssry El-Zehiry, Adel Elmaghraby	Graph cut based deformable model with statistical shape priors.	ICPR	2008	DBLP DOI BibTeX RDF
24	Lei Li 0005, Wenjie Fu, Fan Guo 0006, Todd C. Mowry, Christos Faloutsos	Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps.	KDD	2008	DBLP DOI BibTeX RDF	optimization, Kalman Filters, multi-core, OpenMP, Expectation Maximization (EM), linear dynamical systems
24	Andrew Delong, Yuri Boykov	A Scalable graph-cut algorithm for N-D grids.	CVPR	2008	DBLP DOI BibTeX RDF
24	Silvio Jamil Ferzoli Guimarães, Zenilton Kleber G. do Patrocínio Jr., Hugo Bastos de Paula	A Rotation and Translation Invariant Algorithm for Cut Detection Using Bipartite Graph Matching.	ISM	2008	DBLP DOI BibTeX RDF
24	Chun-Hao Wang, Ling Guan	Graph cut video object segmentation using histogram of oriented gradients.	ISCAS	2008	DBLP DOI BibTeX RDF
24	Olivier Hermant, James Lipton	A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms.	CSL	2008	DBLP DOI BibTeX RDF