Stem cut$ (all stems)

273 papers:

CASE-2015-MoradUHCPV #flexibility #modelling

Modelling and control of a water jet cutting probe for flexible surgical robot (SM, CU, PH, JC, KP, RV), pp. 1159–1164.

DAC-2015-OuTC #self

Cutting structure-aware analog placement based on self-aligned double patterning with e-beam lithography (HCO, KHT, YWC), p. 6.

DAC-2015-SuC #complexity

Nanowire-aware routing considering high cut mask complexity (YHS, YWC), p. 6.

DRR-2015-DavisBS #documentation #segmentation

Min-cut segmentation of cursive handwriting in tabular documents (BLD, WAB, SDS), p. 940208.

STOC-2015-KawarabayashiT #graph

Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (KiK, MT), pp. 665–674.

CHI-2015-BeyerGMCB #3d #named

Platener: Low-Fidelity Fabrication of 3D Objects by Substituting 3D Print with Laser-Cut Plates (DB, SG, SM, HTC, PB), pp. 1799–1806.

DHM-HM-2015-IkenoboWSG #difference #how

Differences in How Long an Ikebana Work Lasts Depending on the Skill Used in Cutting Floral Materials (YI, ZW, YS, AG), pp. 74–82.

KDD-2015-KuoWWCYD #graph #multi #segmentation

Unified and Contrasting Cuts in Multiple Graphs: Application to Medical Imaging Segmentation (CTK, XW, PBW, OTC, JY, ID), pp. 617–626.

HPDC-2015-HeSSI #cost analysis #online #using

Cutting the Cost of Hosting Online Services Using Cloud Spot Markets (XH, PJS, RKS, DEI), pp. 207–218.

CAV-2015-ChristH

Cutting the Mix (JC, JH), pp. 37–52.

CSL-2015-BaazF #logic

Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic (MB, CGF), pp. 94–109.

CSL-2015-HetzlZ

Tree Grammars for the Elimination of Non-prenex Cuts (SH, SZ), pp. 110–127.

TLCA-2015-AfshariHL #context-free grammar

Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars (BA, SH, GEL), pp. 1–16.

DAC-2014-ElbayoumiCKSHE #algorithm #named #parallel #synthesis

TACUE: A Timing-Aware Cuts Enumeration Algorithm for Parallel Synthesis (ME, MC, VNK, AS, MSH, MYE), p. 6.

DAC-2014-LiuFC #process #self #using

Overlay-Aware Detailed Routing for Self-Aligned Double Patterning Lithography Using the Cut Process (IJL, SYF, YWC), p. 6.

ICSME-2014-BellomoENO #performance

Evolutionary Improvements of Cross-Cutting Concerns: Performance in Practice (SB, NAE, RLN, IO), pp. 545–548.

STOC-2014-MakarychevMV #approximate #constant

Constant factor approximation for balanced cut in the PIE model (KM, YM, AV), pp. 41–49.

STOC-2014-SharmaV #multi

Multiway cut, pairwise realizable distributions, and descending thresholds (AS, JV), pp. 724–733.

FLOPS-2014-KrienerK #prolog #revisited #semantics

Semantics for Prolog with Cut — Revisited (JK, AK), pp. 270–284.

DUXU-DI-2014-StickelPM #design

Cutting Edge Design or a Beginner’s Mistake? — A Semiotic Inspection of iOS7 Icon Design Changes (CS, HMP, JTM), pp. 358–369.

ICML-c1-2014-BalanCW

Austerity in MCMC Land: Cutting the Metropolis-Hastings Budget (AKB, YC, MW), pp. 181–189.

ICML-c2-2014-GleichM #algorithm #approximate #case study

Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow (DG, MWM), pp. 1018–1025.

ICPR-2014-AytekinKG #automation #quantum #segmentation

Automatic Object Segmentation by Quantum Cuts (ÇA, SK, MG), pp. 112–117.

ICPR-2014-LiuZH #energy #graph #optimisation

Improved Optimization Based on Graph Cuts for Discrete Energy Minimization (KL, JZ, KH), pp. 2424–2429.

ICPR-2014-ManfrediGC #energy #graph #image #learning #segmentation

Learning Graph Cut Energy Functions for Image Segmentation (MM, CG, RC), pp. 960–965.

ICPR-2014-PuZ #algorithm #segmentation #video

Sandwich Cut: An Algorithm for Temporally-Coherent Video Bilayer Segmentation (SP, HZ), pp. 1061–1066.

ICTSS-2014-PalmieriCO #automation #testing

Cutting Time-to-Market by Adopting Automated Regression Testing in a Simulated Environment (MP, AC, AÖ), pp. 129–144.

IJCAR-2014-HetzlLRTW #logic #quantifier #similarity

Introducing Quantified Cuts in Logic with Equality (SH, AL, GR, JT, DW), pp. 240–254.

RTA-TLCA-2014-Burel

Cut Admissibility by Saturation (GB), pp. 124–138.

CASE-2013-YadatiKBSN #smarttech

Incentive compatible mechanisms for power cut allocation in smart grids (CY, DK, NB, AS, YN), pp. 100–105.

DRR-2013-SvendsenA #documentation #segmentation

Document segmentation via oblique cuts (JS, ABA).

ICDAR-2013-GandhiJ #detection #documentation #image

Detection of Cut-and-Paste in Document Images (AG, CVJ), pp. 653–657.

FoSSaCS-2013-Strassburger #logic

Cut Elimination in Nested Sequents for Intuitionistic Modal Logics (LS), pp. 209–224.

STOC-2013-BuchbinderNS #clustering #exponential #multi #problem

Simplex partitioning via exponential clocks and the multiway cut problem (NB, JN, RS), pp. 535–544.

STOC-2013-GuptaTW #algorithm #bound #graph

Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.

STOC-2013-KaneM

A PRG for lipschitz functions of polynomials with applications to sparsest cut (DMK, RM), pp. 1–10.

DLT-2013-BerglundBDMW #regular expression

Cuts in Regular Expressions (MB, HB, FD, BvdM, BW), pp. 70–81.

ICFP-2013-Morihata #parallel #theorem

A short cut to parallelization theorems (AM), pp. 245–256.

CHI-2013-MuellerKB #3d #named

LaserOrigami: laser-cutting 3D objects (SM, BK, PB), pp. 2585–2592.

CAiSE-2013-BeheshtiBN #ad hoc #analysis #aspect-oriented #process

Enabling the Analysis of Cross-Cutting Aspects in Ad-Hoc Processes (SMRB, BB, HRMN), pp. 51–67.

ICEIS-v1-2013-SimrinAD #heuristic #problem #using

A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method (ASS, NNA, AHD), pp. 565–569.

ICML-c2-2013-Rebagliati #clustering #fault #normalisation #strict

Strict Monotonicity of Sum of Squares Error and Normalized Cut in the Lattice of Clusterings (NR), pp. 163–171.

CAV-2013-PauleveAK #approximate #automaton #network #reachability #scalability #set

Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks (LP, GA, HK), pp. 69–84.

CSL-2013-FortierS #proving #semantics

Cuts for circular proofs: semantics and cut-elimination (JF, LS), pp. 248–262.

SAT-2013-Lauria #bound #proving #rank #theorem

A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem (ML), pp. 351–364.

STOC-2012-ChakrabartiFW #multi #network #problem

When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks (AC, LF, CW), pp. 19–26.

STOC-2012-LouisRTV

Many sparse cuts via higher eigenvalues (AL, PR, PT, SV), pp. 1131–1140.

ICALP-v1-2012-CrowstonJM #bound

Max-Cut Parameterized above the Edwards-Erdős Bound (RC, MJ, MM), pp. 242–253.

ICALP-v1-2012-KleinM

Solving Planar k-Terminal Cut in $O(n^(c√k)) Time (PNK, DM), pp. 569–580.

ICALP-v1-2012-LokshtanovR #constraints #multi

Parameterized Tractability of Multiway Cut with Parity Constraints (DL, MSR), pp. 750–761.

ICALP-v1-2012-Marx #bound #multi

A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals (DM), pp. 677–688.

CHI-2012-VoidaBOOD #distributed

Cross-cutting faultlines of location and shared identity in the intergroup cooperation of partially distributed groups (AV, NB, JSO, GMO, LD), pp. 3101–3110.

CIKM-2012-ChiangWD #clustering #network #normalisation #scalability #using

Scalable clustering of signed networks using balance normalized cut (KYC, JJW, ISD), pp. 615–624.

ICPR-2012-AntoniukFH #learning #markov #network

Learning Markov Networks by Analytic Center Cutting Plane Method (KA, VF, VH), pp. 2250–2253.

ICPR-2012-GhoseMOMLFVCSM12a #3d #energy #framework #graph #learning #probability #segmentation

Graph cut energy minimization in a probabilistic learning framework for 3D prostate segmentation in MRI (SG, JM, AO, RM, XL, JF, JCV, JC, DS, FM), pp. 125–128.

ICPR-2012-PaulhacTM #image #segmentation

Relaxed Cheeger Cut for image segmentation (LP, VTT, RM), pp. 3321–3324.

ICPR-2012-WeibelDWR #detection #graph #using

Contrast-enhancing seam detection and blending using graph cuts (TW, CD, DW, RR), pp. 2732–2735.

ICPR-2012-ZhangCYLS #constraints #graph

Stereo matching with Global Edge Constraint and Graph Cuts (HZ, FC, DY, YL, MS), pp. 372–375.

KDD-2012-GleichS #community

Vertex neighborhoods, low conductance cuts, and good seeds for local community methods (DFG, CS), pp. 597–605.

PADL-2012-BalducciniL #aspect-oriented #tool support

Practical and Methodological Aspects of the Use of Cutting-Edge ASP Tools (MB, YL), pp. 78–92.

SAC-PL-J-2009-J-CervelleFLR12 #implementation #parsing #using

Banzai+Tatoo: Using cutting-edge parsers for implementing high-performance servers (JC, RF, GL, GR), pp. 990–1005.

CSL-2012-DeYoungCPT #communication #linear #logic #reduction

Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication (HD, LC, FP, BT), pp. 228–242.

CSL-2012-HetzlS #first-order #logic

Herbrand-Confluence for Cut Elimination in Classical First Order Logic (SH, LS), pp. 320–334.

LICS-2012-AvronKZ #calculus #composition #logic

Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics (AA, BK, AZ), pp. 85–94.

RTA-2012-CousineauH #proving #semantics

A Semantic Proof that Reducibility Candidates entail Cut Elimination (DC, OH), pp. 133–148.

CASE-2011-SernaCBRC #case study #design #framework

Control software design for a cutting glass machine tool based on the COSME platform. Case study (FS, CC, AB, JMR, JMC), pp. 501–506.

ICDAR-2011-KesidisG #estimation #performance #word

Efficient Cut-Off Threshold Estimation for Word Spotting Applications (ALK, BG), pp. 279–283.

STOC-2011-ItalianoNSW #algorithm #graph

Improved algorithms for min cut and max flow in undirected planar graphs (GFI, YN, PS, CWN), pp. 313–322.

ICALP-v1-2011-ElsasserT #complexity

Settling the Complexity of Local Max-Cut (Almost) Completely (RE, TT), pp. 171–182.

CHI-2011-YangGIF #proximity #using

TouchCuts and TouchZoom: enhanced target selection for touch displays using finger proximity sensing (XDY, TG, PI, GWF), pp. 2585–2594.

HCI-DDA-2011-HeL #graph #image #modelling #segmentation

An Image Segmentation Method for Chinese Paintings by Combining Deformable Models with Graph Cuts (NH, KL), pp. 571–579.

ICML-2011-JegelkaB11a #approximate #bound #using

Approximation Bounds for Inference using Cooperative Cuts (SJ, JAB), pp. 577–584.

SIGIR-2011-QianH

Graph-cut based tag enrichment (XQ, XSH), pp. 1111–1112.

CADE-2011-JovanovicM #integer #linear

Cutting to the Chase Solving Linear Integer Arithmetic (DJ, LMdM), pp. 338–353.

CASE-2010-AngererEHRRS #automation

Automated cutting and handling of carbon fiber fabrics in aerospace industries (AA, CE, AH, WR, GR, GS), pp. 861–866.

DATE-2010-MartinelloMRR #approach #logic #multi #named #synthesis

KL-Cuts: A new approach for logic synthesis targeting multiple output blocks (OM, FSM, RPR, AIR), pp. 777–782.

ICML-2010-SzlamB

Total Variation, Cheeger Cuts (AS, XB), pp. 1039–1046.

ICPR-2010-AslanAFRAX #3d #graph #segmentation #using

3D Vertebral Body Segmentation Using Shape Based Graph Cuts (MSA, AMA, AAF, HMR, BA, PX), pp. 3951–3954.

ICPR-2010-LeskoKNGTVV #graph #segmentation

Live Cell Segmentation in Fluorescence Microscopy via Graph Cut (ML, ZK, AN, IG, ZT, LVJ, LV), pp. 1485–1488.

ICPR-2010-PhamTN #bound #segmentation #similarity #using

Bounding-Box Based Segmentation with Single Min-cut Using Distant Pixel Similarity (VQP, KT, TN), pp. 4420–4423.

LOPSTR-2010-StroderSG #analysis #dependence #logic programming #source code #termination

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (TS, PSK, JG), pp. 184–199.

FSE-2010-WuLWXLLGGZZ #data flow

Language-based replay via data flow cut (MW, FL, XW, ZX, HL, XL, ZG, HG, LZ, ZZ), pp. 197–206.

ICSE-2010-Hill #execution #integration #modelling #named #testing

CUTS: a system execution modeling tool for realizing continuous system integration testing (JHH), pp. 309–310.

ICSE-2010-YangL #approach #bound #verification

A cut-off approach for bounded verification of parameterized systems (QY, ML), pp. 345–354.

ICLP-2010-Zwirchmayr10 #analysis

Cutting-Edge Timing Analysis Techniques (JZ), pp. 303–305.

ICLP-J-2010-Schneider-KampGSST #analysis #automation #logic programming #source code #termination

Automated termination analysis for logic programs with cut (PSK, JG, TS, AS, RT), pp. 365–381.

IJCAR-2010-GoreW #logic

Optimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse (RG, FW), pp. 225–239.

DAC-2009-JainC #graph #performance #satisfiability #using

Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts (HJ, EMC), pp. 563–568.

STOC-2009-AndersenP #evolution #set #using

Finding sparse cuts locally using evolving sets (RA, YP), pp. 235–244.

STOC-2009-ChambersEN

Homology flows, cohomology cuts (EWC, JE, AN), pp. 273–282.

STOC-2009-Trevisan

Max cut and the smallest eigenvalue (LT), pp. 263–272.

HIMI-DIE-2009-KawashimoSDAT

A Skill Transfer Method for Manual Machine Tool Operation Utilizing Cutting Sound (TK, NS, DD, MA, TT), pp. 77–86.

SIGIR-2009-GongO #ambiguity #clustering #web

Selecting hierarchical clustering cut points for web person-name disambiguation (JG, DWO), pp. 778–779.

CAV-2009-DilligDA #integer #linear #proving

Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers (ID, TD, AA), pp. 233–247.

TLCA-2009-Pagani #difference #theorem

The Cut-Elimination Theorem for Differential Nets with Promotion (MP), pp. 219–233.

ECSA-2008-MyllarniemiPRGM #approach #architecture #constraints #distributed

Approach for Dynamically Composing Decentralised Service Architectures with Cross-Cutting Constraints (VM, CP, MR, JvG, TM), pp. 180–195.

FoSSaCS-2008-KikuchiL #normalisation

Strong Normalisation of Cut-Elimination That Simulates β-Reduction (KK, SL), pp. 380–394.

STOC-2008-ManokaranNRS #metric #multi

Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling (RM, JN, PR, RS), pp. 11–20.

STOC-2008-ODonnellW #algorithm #testing

An optimal sdp algorithm for max-cut, and equally optimal long code tests (RO, YW), pp. 335–344.

STOC-2008-Thorup

Minimum k-way cuts via deterministic greedy tree packing (MT), pp. 159–166.

ICALP-A-2008-ChekuriK #algorithm #problem

Algorithms for 2-Route Cut Problems (CC, SK), pp. 472–484.

ICALP-A-2008-Pritchard #distributed #performance #random

Fast Distributed Computation of Cuts Via Random Circulations (DP), pp. 145–160.

CHI-2008-BonanniACVI #named

Handsaw: tangible exploration of volumetric data by direct cut-plane projection (LB, JA, NC, GV, HI), pp. 251–254.

CSCW-2008-NomuraBRLTG #collaboration #comprehension #coordination #distributed #research

Cutting into collaboration: understanding coordination in distributed and interdisciplinary medical research (SN, JPB, OR, GL, DT, GG), pp. 427–436.

ICML-2008-FrancS #algorithm

Optimized cutting plane algorithm for support vector machines (VF, SS), pp. 320–327.

ICPR-2008-ChenS #constraints #image #segmentation

Medical image segmentation via min s-t cuts with sides constraints (JHC, LGS), pp. 1–4.

ICPR-2008-El-ZehiryE #constraints

Agraph cut based active contour without edges with relaxed homogeneity constraint (NYEZ, AE), pp. 1–4.

ICPR-2008-FuCLL #approach #automation #segmentation

Saliency Cuts: An automatic approach to object segmentation (YF, JC, ZL, HL), pp. 1–4.

ICPR-2008-FundanaHGS #graph #segmentation

Continuous graph cuts for prior-based object segmentation (KF, AH, CG, CS), pp. 1–4.

ICPR-2008-GongC #graph #learning #online #optimisation #realtime #segmentation #using

Real-time foreground segmentation on GPUs using local online learning and global graph cut optimization (MG, LC), pp. 1–4.

ICPR-2008-GuimaraesPP #approach #detection #difference #distance #graph #using #video

An approach for video cut detection using bipartite graph matching as dissimilarity distance (SJFG, ZKGdPJ, HBdP), pp. 1–4.

ICPR-2008-MakiharaY #segmentation

Silhouette extraction based on iterative spatio-temporal local color transformation and graph-cut segmentation (YM, YY), pp. 1–4.

ICPR-2008-MooreSLD #image #segmentation #top-down #using

Top down image segmentation using congealing and graph-cut (DM, JS, SL, BAD), pp. 1–4.

ICPR-2008-SugaFTA #graph #recognition #segmentation #using

Object recognition and segmentation using SIFT and Graph Cuts (AS, KF, TT, YA), pp. 1–4.

ICPR-2008-TangG #constraints #graph #segmentation #video

Video object segmentation based on graph cut with dynamic shape prior constraint (PT, LG), pp. 1–4.

KDD-2008-LiFGMF #learning #linear #named #parallel #performance

Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps (LL, WF, FG, TCM, CF), pp. 471–479.

KDD-2008-YuJ #kernel #using

Training structural svms with kernels using sampled cuts (CNJY, TJ), pp. 794–802.

KDD-2008-ZhaoWZ #algorithm #named #performance #virtual machine

Cuts3vm: a fast semi-supervised svm algorithm (BZ, FW, CZ), pp. 830–838.

CSL-2008-HermantL #approach #axiom #semantics

A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (OH, JL), pp. 169–183.

LICS-2008-AehligB #complexity #on the

On the Computational Complexity of Cut-Reduction (KA, AB), pp. 284–293.

LICS-2008-LaurentM #proving

Cut Elimination for Monomial MALL Proof Nets (OL, RM), pp. 486–497.

RTA-2008-UrbanZ #proving

Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof (CU, BZ), pp. 409–424.

CASE-2007-HolleCHHM

Characterization of Program Controlled CO2 Laser-Cut PDMS Channels for Lab-on-a-chip Applications (AWH, ShC, MH, JMH, DRM), pp. 621–627.

CASE-2007-NishiHIG #composition #generative #multi #scheduling

A Decomposition Method with Cut Generation for Simultaneous Production Scheduling and Routing for multiple AGVs (TN, YH, MI, IEG), pp. 658–663.

CASE-2007-ShiomiSOOYKI #2d #problem #process

The Solution of 2-Dimensional Rectangular Cutting Stock Problem Considering Cutting Process (YS, MS, JO, TO, MY, HK, KI), pp. 140–145.

STOC-2007-AgarwalAC #approximate #problem

Improved approximation for directed cut problems (AA, NA, MC), pp. 671–680.

STOC-2007-BrinkmanKL #graph #random #reduction

Vertex cuts, random walks, and dimension reduction in series-parallel graphs (BB, AK, JRL), pp. 621–630.

STOC-2007-ChuzhoyK #polynomial #problem

Polynomial flow-cut gaps and hardness of directed cut problems (JC, SK), pp. 179–188.

STOC-2007-SchoenebeckTT

Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut (GS, LT, MT), pp. 302–310.

CC-2007-GrundH #algorithm #performance

A Fast Cutting-Plane Algorithm for Optimal Coalescing (DG, SH), pp. 111–125.

CSL-2007-GaintzarainHLNO #calculus #invariant

A Cut-Free and Invariant-Free Sequent Calculus for PLTL (JG, MH, PL, MN, FO), pp. 481–495.

RTA-2007-DowekH #proving

A Simple Proof That Super-Consistency Implies Cut Elimination (GD, OH), pp. 93–106.

TLCA-2007-Nakazawa #morphism #proving #reduction

An Isomorphism Between Cut-Elimination Procedure and Proof Reduction (KN), pp. 336–350.

HT-2006-QiC #analysis #development #named #segmentation

CUTS: CUrvature-based development pattern analysis and segmentation for blogs and other Text Streams (YQ, KSC), pp. 1–10.

MSR-2006-BreuZL #eclipse #mining

Mining eclipse for cross-cutting concerns (SB, TZ, CL), pp. 94–97.

STOC-2006-ChuzhoyK #graph #problem

Hardness of cut problems in directed graphs (JC, SK), pp. 527–536.

STOC-2006-DevanurKSV #linear #problem

Integrality gaps for sparsest cut and minimum linear arrangement problems (NRD, SK, RS, NKV), pp. 537–546.

ICALP-v1-2006-BaierEHKSS #bound

Length-Bounded Cuts and Flows (GB, TE, AH, EK, HS, MS), pp. 679–690.

SOFTVIS-2006-LunguL #named #visualisation

Softwarenaut: cutting edge visualization (ML, ML), pp. 179–180.

ICML-2006-Hanneke #analysis #graph #learning

An analysis of graph cut size for transductive learning (SH), pp. 393–399.

ICPR-v1-2006-ChenCLT #algorithm #automation #graph #image #segmentation #using

Automatic Segmentation of Lung Fields from Radiographic Images of SARS Patients Using a New Graph Cuts Algorithm (SC, LC, JL, XT), pp. 271–274.

ICPR-v2-2006-AhnKB #estimation #graph #robust #segmentation #using

Robust Object Segmentation Using Graph Cut with Object and Background Seed Estimation (JHA, KCK, HB), pp. 361–364.

ICPR-v4-2006-FengL #clustering #graph #self

Self-Validated and Spatially Coherent Clustering with Net-Structured MRF and Graph Cuts (WF, ZQL), pp. 37–40.

ICPR-v4-2006-SunYMW #energy #segmentation

Better Foreground Segmentation for Static Cameras via New Energy Form and Dynamic Graph-cut (YS, BY, ZM, CW), pp. 49–52.

ICPR-v4-2006-VietKT #3d #algorithm

An Algorithm for Cutting 3D Surface Meshes (HQHV, TK, HTT), pp. 762–765.

PADL-2006-SoaresRF #prolog

Generic Cut Actions for External Prolog Predicates (TS, RR, MF), pp. 16–30.

IJCAR-2006-BenzmullerBK #logic

Cut-Simulation in Impredicative Logics (CB, CEB, MK), pp. 220–234.

IJCAR-2006-DyckhoffKL #bound #calculus #logic

Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic (RD, DK, SL), pp. 347–361.

ICDAR-2005-Meunier #order

Optimized XY-Cut for Determining a Page Reading Order (JLM), pp. 347–351.

CSMR-2005-BublB #constraints #requirements

Tracing Cross-Cutting Requirements via Context-Based Constraints (FB, MB), pp. 80–90.

STOC-2005-AgarwalCMM #algorithm #approximate #problem

O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (AA, MC, KM, YM), pp. 573–581.

STOC-2005-AroraLN

Euclidean distortion and the sparsest cut (SA, JRL, AN), pp. 553–562.

ICFP-2005-GhaniJUV #monad

Monadic augment and generalised short cut fusion (NG, PJ, TU, VV), pp. 294–305.

MLDM-2005-GhoshGYB #algorithm #analysis #comparative #network #search-based

Comparative Analysis of Genetic Algorithm, Simulated Annealing and Cutting Angle Method for Artificial Neural Networks (RG, MG, JY, AMB), pp. 62–70.

SAC-2005-GuoLLW #linear #problem

The shortest route cut and fill problem in linear topological structure (SG, WL, AL, FW), pp. 409–410.

SAT-2005-HirschN #proving #simulation #strict

Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution (EAH, SIN), pp. 135–142.

SAT-2005-ManquinhoM #algorithm #on the #optimisation #pseudo

On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization (VMM, JPMS), pp. 451–458.

TLCA-2005-Hermant #calculus #semantics

Semantic Cut Elimination in the Intuitionistic Sequent Calculus (OH), pp. 221–233.

DAC-2004-AnastasakisMP #equivalence #performance

Efficient equivalence checking with partitions and hierarchical cut-points (DA, LM, SP), pp. 539–542.

DAC-2004-KahngR #concept #feedback

Placement feedback: a concept and method for better min-cut placements (ABK, SR), pp. 357–362.

DATE-v2-2004-KahngMR #named

Boosting: Min-Cut Placement with Improved Signal Delay (ABK, ILM, SR), pp. 1098–1103.

PLDI-2004-JohnsonEV #composition #concurrent #thread

Min-cut program decomposition for thread-level speculation (TAJ, RE, TNV), pp. 59–70.

STOC-2004-AlonN #approximate #difference

Approximating the cut-norm via Grothendieck’s inequality (NA, AN), pp. 72–80.

CSCW-2004-GarciaKF #effectiveness

Cutting to the chase: improving meeting effectiveness by focusing on the agenda (ACBG, JCK, MAF), pp. 346–349.

EDOC-2004-DuddyLM

Elemental and Pegamento: The Final Cut — Applying the MDA Pattern (KD, ML, ZM), pp. 240–252.

ICPR-v2-2004-EwerthF #detection #difference #normalisation

Improving Cut Detection in MPEG Videos by GOP-Oriented Frame Difference Normalization (RE, BF), pp. 807–810.

ICPR-v2-2004-YuXA #graph #sequence #using #video

Reconstructing a Dynamic Surface from Video Sequences Using Graph Cuts in 4D Space-Time (TY, NX, NA), pp. 245–248.

ICPR-v4-2004-XuTAA #generative #graph #image #using

Generating Omnifocus Images Using Graph Cuts and a New Focus Measure (NX, KHT, HA, NA), pp. 697–700.

KDD-2004-DhillonGK #clustering #kernel #normalisation

Kernel k-means: spectral clustering and normalized cuts (ISD, YG, BK), pp. 551–556.

UML-2004-GeorgRF #specification

Specifying Cross-Cutting Requirement Concerns (GG, RR, RBF), pp. 113–127.

PADL-2004-ChenZX #case study #dependent type #haskell #implementation #simulation

Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell (CC, DZ, HX), pp. 239–254.

STOC-2003-AmirKR #approximate #constant #graph

Constant factor approximation of vertex-cuts in planar graphs (EA, RK, SR), pp. 90–99.

STOC-2003-AronovKS

Cutting triangular cycles of lines in space (BA, VK, MS), pp. 547–555.

ICALP-2003-ChekuriGN #approximate

Approximating Steiner k-Cuts (CC, SG, JN), pp. 189–199.

ICALP-2003-Coja-OghlanMS #approximate #graph #random

MAX k-CUT and Approximating the Chromatic Number of Random Graphs (ACO, CM, VS), pp. 200–211.

ICALP-2003-GutierrezR #calculus #type system

Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems (FG, BCR), pp. 956–968.

CSL-2003-Brunnler #logic

Atomic Cut Elimination for classical Logic (KB), pp. 86–97.

CSL-2003-Gerhardy #analysis #complexity

Refined Complexity Analysis of Cut Elimination (PG), pp. 212–225.

RTA-2003-Dowek #confluence

Confluence as a Cut Elimination Property (GD), pp. 2–13.

TLCA-2003-SantoP #calculus #multi

Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts (JES, LP), pp. 286–300.

CSEET-2002-DuleyM

Cutting Hacking: Breaking from Tradition (RD, SPM), pp. 224–233.

FLOPS-2002-CaballeroL

Dynamic-Cut with Definitional Trees (RC, FJLF), pp. 245–258.

ICPR-v1-2002-YangP #locality

Harmonic Cut and Regularized Centroid Transform for Localization of Subcellular Structures (QY, BP), pp. 788–791.

SEKE-2002-Lascio #fuzzy #logic

Hilbertian systems, analytic fuzzy tableaux and cut rule elimination in rational pavelka logic (LDL), pp. 117–124.

LOPSTR-2002-GutierrezR #calculus #type system #verification

A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene (FG, BCR), pp. 17–31.

LOPSTR-2002-VanhoofTB #fixpoint #logic programming #semantics #source code

A Fixed Point Semantics for Logic Programs Extended with Cuts (WV, RT, MB), pp. 238–257.

FSE-2002-LiKF #verification

Verifying cross-cutting features as open systems (HCL, SK, KF), pp. 89–98.

DAC-2001-YildizM #clustering #sequence

Improved Cut Sequences for Partitioning Based Placement (MCY, PHM), pp. 776–779.

STOC-2001-FeigeS #on the

On the integrality ratio of semidefinite relaxations of MAX CUT (UF, GS), pp. 433–442.

STOC-2001-GoemansW #algorithm #approximate #problem #programming

Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (MXG, DPW), pp. 443–452.

STOC-2001-Thorup

Fully-dynamic min-cut (MT), pp. 224–230.

SAIG-2001-Johann

Short Cut Fusion: Proved and Improved (PJ), pp. 47–71.

TLCA-2001-Laird #nondeterminism

A Deconstruction of Non-deterministic Classical Cut Elimination (JL), pp. 268–282.

TLCA-2001-Urban #normalisation

Strong Normalisation for a Gentzen-like Cut-Elimination Procedure (CU), pp. 415–430.

DAC-2000-OuP #clustering

Timing-driven placement based on partitioning with dynamic cut-net control (SLTO, MP), pp. 472–476.

ICALP-2000-Santo #normalisation

Revisiting the Correspondence between Cut Elimination and Normalisation (JES), pp. 600–611.

ICPR-v3-2000-PorterMT #correlation #detection #using #video

Video Cut Detection using Frequency Domain Correlation (SVP, MM, BTT), pp. 3413–3416.

WCRE-1999-Cifuentes #development #reverse engineering

The Impact of Copyright on the Development of Cutting Edge Binary Reverse Engineering Technology (CC), pp. 66–76.

WCRE-1999-Jermaine #using

Computing Program Modularizations Using the k-Cut Method (CJ), pp. 224–234.

STOC-1999-KargerKSTY #algorithm #geometry #multi

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut (DRK, PNK, CS, MT, NEY), pp. 668–678.

STOC-1999-Zwick99a #problem #programming

Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems (UZ), pp. 679–687.

ICFP-1999-Chitil #deforestation #type inference

Type Inference Builds a Short Cut to Deforestation (OC), pp. 249–260.

IFL-1999-Chitil #deforestation

Type-Inference Based Short Cut Deforestation (Nearly) without Inlining (OC), pp. 19–35.

CHI-1999-McDanielM

Getting More Cut of Programming-by-Demonstration (RGM, BAM), pp. 442–449.

CADE-1999-BaazLM

System Description: CutRes 0.1: Cut Elimination by Resolution (MB, AL, GM), pp. 212–216.

LICS-1999-CerritoaK #pattern matching

Pattern Matching as Cut Elimination (SC, DK), pp. 98–108.

TLCA-1999-UrbanB #logic #normalisation

Strong Normalisation of Cut-Elimination in Classical Logic (CU, GMB), pp. 365–380.

HT-1998-TajimaMKT #email #query

Cut as a Querying Unit for WWW, Netnews, e-mail (KT, YM, MK, KT), pp. 235–244.

STOC-1998-CalinescuKR #algorithm #approximate #multi

An Improved Approximation Algorithm for Multiway Cut (GC, HJK, YR), pp. 48–52.

ICPR-1998-KanekoH #detection #using #video

Cut detection technique from MPEG compressed video using likelihood ratio test (TK, OH), pp. 1476–1480.

DAC-1997-KuehlmannK #equivalence #using

Equivalence Checking Using Cuts and Heaps (AK, FK), pp. 263–268.

PODS-1997-AtzeniM

Cut & Paste (PA, GM), pp. 144–153.

HCI-SEC-1997-Ibrahim #editing #optimisation

Optimizing Cut-and-Paste Operations in Directed-Graph Editing (BI), pp. 359–362.

HPDC-1997-YocumCGL

Cut-Through Delivery in Trapeze: An Exercise in Low-Latency Messaging (KY, JSC, AJG, ARL), pp. 243–252.

LICS-1997-CosmoK #normalisation #proving

Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract) (RDC, DK), pp. 35–46.

STOC-1996-BenczurK #approximate

Approximating s-t Minimum Cuts in Õ(n2) Time (AAB, DRK), pp. 47–55.

STOC-1996-Fu #composition #proving

Modular Coloring Formulas Are Hard for Cutting Planes Proofs (XF), pp. 595–602.

STOC-1996-Karger

Minimum Cuts in Near-Linear Time (DRK), pp. 56–63.

STOC-1996-Karloff #algorithm #how #question

How Good is the Goemans-Williamson MAX CUT Algorithm? (HJK), pp. 427–434.

STOC-1996-KleinL #algorithm #approximate #performance #source code

Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING (PNK, HIL), pp. 338–347.

ICML-1996-AbeL #learning #modelling #using #word

Learning Word Association Norms Using Tree Cut Pair Models (NA, HL), pp. 3–11.

HPDC-1996-NicklasASW #clustering #parallel #problem

A Parallel Solution to the Cutting Stock Problem for a Cluster of Workstations (LDN, RWA, SS, PYW), pp. 521–530.

CSL-1996-BaazL #performance

Fast Cut-Elimination by Projection (MB, AL), pp. 18–33.

CSL-1996-Gore #algebra #calculus

Cut-free Display Calculi for Relation Algebras (RG), pp. 198–210.

ICDAR-v2-1995-HaHP #bound #component #recursion #using

Recursive X-Y cut using bounding boxes of connected components (JH, RMH, ITP), pp. 952–955.

ICDAR-v2-1995-YangL

Color quantization by RWM-cut (CYY, JCL), pp. 669–672.

STOC-1995-BonetPR #bound #proving

Lower bounds for cutting planes proofs with small coefficients (MLB, TP, RR), pp. 575–584.

STOC-1995-DinitzN #graph #incremental #maintenance

A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance (YD, ZN), pp. 509–518.

ICALP-1995-Henzinger #approximate

Approximating Minimum Cuts under Insertions (MRH), pp. 280–291.

ICLP-1995-BarthB #finite

Finite Domain and Cutting Plane Techniques in CLP(PB) (PB, AB), pp. 133–147.

ILPS-1995-Andrews #prolog #semantics

A Paralogical Semantics for the Prolog Cut (JHA), pp. 591–605.

LICS-1995-Pfenning

Structural Cut Elimination (FP), pp. 156–166.

LICS-1995-Simpson #composition #logic

Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS (AKS), pp. 420–430.

DAC-1994-BuiM #algorithm #clustering #hybrid #performance #problem #search-based

A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs (TNB, BRM), pp. 664–669.

STOC-1994-GoemansW #algorithm #approximate #satisfiability

.879-approximation algorithms for MAX CUT and MAX 2SAT (MXG, DPW), pp. 422–431.

STOC-1994-Karger #design #network #problem #random

Random sampling in cut, flow, and network design problems (DRK), pp. 648–657.

ICALP-1994-BuhrmanT #bound #on the

On the Cutting Edge of Relativization: The Resource Bounded Injury Method (HB, LT), pp. 263–273.

ICALP-1994-GargVY #graph #multi

Multiway Cuts in Directed and Node Weighted Graphs (NG, VVV, MY), pp. 487–498.

ILPS-1994-CharlierRH #abstract interpretation #framework #prolog

An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut (BLC, SR, PVH), pp. 157–171.

LICS-1994-ImpagliazzoPU #bound #proving

Upper and Lower Bounds for Tree-Like Cutting Planes Proofs (RI, TP, AU), pp. 220–228.

LICS-1994-LincolnS #calculus #first-order #linear #logic #proving

Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi (PL, NS), pp. 282–291.

DAC-1993-ChanSZ93a #clustering

Spectral K-Way Ratio-Cut Partitioning and Clustering (PKC, MDFS, JYZ), pp. 749–754.

ICDAR-1993-BayerK #classification #segmentation

Cut classification for segmentation (TAB, UK), pp. 565–568.

STOC-1993-GargVY #approximate #multi #theorem

Approximate max-flow min-(multi)cut theorems and their applications (NG, VVV, MY), pp. 698–707.

STOC-1993-KargerS #algorithm

An O~(n2) algorithm for minimum cuts (DRK, CS), pp. 757–765.

STOC-1993-ParkP #graph

Finding minimum-quotient cuts in planar graphs (JKP, CAP), pp. 766–775.

STOC-1993-PlotkinT #bound #multi

Improved bounds on the max-flow min-cut ratio for multicommodity flows (SAP, ÉT), pp. 691–697.

FPCA-1993-GillLJ #deforestation

A Short Cut to Deforestation (AJG, JL, SLPJ), pp. 223–232.

STOC-1992-DahlhausJPSY #complexity #multi

The Complexity of Multiway Cuts (Extended Abstract) (ED, DSJ, CHP, PDS, MY), pp. 241–251.

STOC-1992-LoMS

Ham-Sandwich Cuts in R^d (CYL, JM, WLS), pp. 539–545.

STOC-1992-Rao #algorithm #graph #performance

Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) (SR), pp. 229–240.

ICALP-1992-VaziraniY

Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract) (VVV, MY), pp. 366–377.

CSL-1992-BaazZ #algorithm #proving

Algorithmic Structuring of Cut-free Proofs (MB, RZ), pp. 29–42.

LICS-1992-Clote #constant #proving

Cutting Planes and constant depth Frege proofs (PC), pp. 296–307.

ICALP-1991-Loebl #graph #performance #polynomial

Efficient Maximal Cubic Graph Cuts (Extended Abstract) (ML), pp. 351–362.

CSL-1991-Goerdt #bound #proving

The Cutting Plane Proof System with Bounded Degree of Falsity (AG), pp. 119–133.

CSL-1991-Schmerl #proving #source code

A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs (URS), pp. 316–325.

DAC-1990-TeraiTS #algorithm #assurance #constraints #design #layout

A New Min-Cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constraint (MT, KT, KS), pp. 96–102.

NACLP-1989-BugliesiR #partial evaluation #prolog

Partial Evaluation in Prolog: Some Improvements about Cut (MB, FR), pp. 645–660.

DAC-1988-BhandariHS #problem #towards

The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement (ISB, MH, DPS), pp. 681–685.

JICSCP-1988-DincbasSH88 #constraints #logic programming #problem

Solving a Cutting-Stock Problem in Constraint Logic Programming (MD, HS, PVH), pp. 42–58.

STOC-1987-ChazelleEG #complexity

The Complexity of Cutting Convex Polytopes (BC, HE, LJG), pp. 66–76.

SLP-1987-Ali87 #execution #implementation #parallel #prolog

A Method for Implementing Cut in Parallel Execution of Prolog (KAMA), pp. 449–456.

ICALP-1986-MonienS

Min Cut is NP-Complete for Edge Weighted Trees (BM, IHS), pp. 265–274.

ICLP-1986-Moss86 #prolog

Cut and Paste — defining the impure Primitives of Prolog (CM), pp. 686–694.

SLP-1986-BarklundM86 #garbage collection #prolog #source code

Garbage Cut for Garbage Collection of Iterative Prolog Programs (JB, HM), pp. 276–283.

SLP-1985-OKeefe85 #on the #prolog #tool support

On the Treatment of Cuts in Prolog Source-Level Tools (RAO), pp. 68–72.

ICALP-1983-YannakakisKCP #clustering #graph

Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract) (MY, PCK, SSC, CHP), pp. 712–722.

DAC-1982-WipflerWM #algorithm #layout

A combined force and cut algorithm for hierarchical VLSI layout (GJW, MW, DAM), pp. 671–677.

ICALP-1981-Reif #network

Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time (JHR), pp. 56–67.

DAC-1979-Lauther #algorithm #graph #representation

A min-cut placement algorithm for general cell assemblies based on a graph representation (UL), pp. 1–10.

DAC-1977-Breuer #algorithm

A class of min-cut placement algorithms (MAB), pp. 284–290.

DAC-1974-Barnes #automation #design

Automated sign design and stencil cutting system (WMB), pp. 300–307.