Search results for "$k$-Cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Christian Wolf 0002, Achim Koberstein	Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method.	Eur. J. Oper. Res.	2013	DBLP DOI BibTeX RDF
19	Mijung Kim, K. Selçuk Candan	SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices.	Data Knowl. Eng.	2012	DBLP DOI BibTeX RDF
19	Neng Fan, Panos M. Pardalos	Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs.	J. Comb. Optim.	2012	DBLP DOI BibTeX RDF
19	Geert Vanderhulst, Lieven Trappeniers	Cut and Paste: Ambient Interaction Using Annotated Cut-Outs.	AmI	2011	DBLP DOI BibTeX RDF
19	Igor Razgon	Computing multiway cut within the given excess over the largest minimum isolating cut	CoRR	2010	DBLP BibTeX RDF
19	Juan José Salazar González	Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression.	Privacy in Statistical Databases	2010	DBLP DOI BibTeX RDF
19	Clayton W. Commander	Maximum Cut Problem, MAX-CUT.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF
19	Yang Yuan, Suvrajeet Sen	Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs.	INFORMS J. Comput.	2009	DBLP DOI BibTeX RDF
19	Marcelo Finger, Dov M. Gabbay	Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs.	Log. J. IGPL	2007	DBLP DOI BibTeX RDF
19	Terry Gorman, Shyqyri Haxha	Full-Wave Comparison of Z-cut and X-cut Lithium Niobate (LiNbO3) Electrooptic Modulators Using Finite Element Method.	World Congress on Engineering	2007	DBLP BibTeX RDF
19	Francisco Barahona, Laszlo Ladányi	Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut.	RAIRO Oper. Res.	2006	DBLP DOI BibTeX RDF
19	Ramavarapu S. Sreenivas	On supervisory policies that enforce liveness in completely controlled Petri nets with directed cut-places and cut-transitions.	IEEE Trans. Autom. Control.	1999	DBLP DOI BibTeX RDF
19	Mohamed Ekbal Bouzgarrou	Parallélisation de la méthode du "Branch and Cut" pour résoudre le problème du voyageur de commerce. (Parallel Branch and Cut for the Traveling Salesman Problem).		1998	RDF
19	Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura	A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms.	Discret. Appl. Math.	1996	DBLP DOI BibTeX RDF
19	Sridhar Hannenhalli, Pavel A. Pevzner	To Cut... or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution).	SODA	1996	DBLP DOI BibTeX RDF
19	Wenhui Zhang	Depth of Proofs, Depth of Cut-Formulas and Complexity of Cut Formulas.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
19	Marcello D'Agostino, Marco Mondadori	The Taming of the Cut. Classical Refutations with Analytic Cut.	J. Log. Comput.	1994	DBLP DOI BibTeX RDF
19	Michele Conforti, M. R. Rao	Some New Matroids on Graphs: Cut Sets and the Max Cut Problem.	Math. Oper. Res.	1987	DBLP DOI BibTeX RDF
16	Yuanning Li, Yonghong Tian 0001, Jingjing Yang, Ling-Yu Duan, Wen Gao 0001	Video retargeting with multi-scale trajectory optimization.	Multimedia Information Retrieval	2010	DBLP DOI BibTeX RDF	max-flow/min-cut, multi-scale trajectory optimization, spatio-temporal saliency, video retargeting
16	Tinghuai Wang, John P. Collomosse, David Slatter, Phil Cheatle, Darryl Greig	Video stylization for digital ambient displays of home movies.	NPAR	2010	DBLP DOI BibTeX RDF	video stylization, segmentation, composition, graph cut, ambient displays, temporal coherence
16	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	J. ACM	2009	DBLP DOI BibTeX RDF	Edge-separator, single commodity max-flow, sparse cut, spectral method
16	Norihiro Kamide	Proof Systems Combining Classical and Paraconsistent Negations.	Stud Logica	2009	DBLP DOI BibTeX RDF	Paraconsistent negation, completeness, sequent calculus, cut-elimination
16	Ann-Sophie Pepin, Guy Desaulniers, Alain Hertz, Dennis Huisman	A comparison of five heuristics for the multiple depot vehicle scheduling problem.	J. Sched.	2009	DBLP DOI BibTeX RDF	Vehicle scheduling, Multiple depot, Lagrangian heuristic, Large neighborhood search, Heuristics, Tabu search, Column generation, Branch-and-cut
16	Guntae Bae, Soo Yeong Kwak, Hyeran Byun	Interactive Object Segmentation System from a Video Sequence.	HCI (9)	2009	DBLP DOI BibTeX RDF	trimap generation, trimap estimation, interactive System, Graph Cut, Object Segmentation
16	James Brotherston, Cristiano Calcagno	Classical BI: a logic for reasoning about dualising resources.	POPL	2009	DBLP DOI BibTeX RDF	bunched implications, classical bi, display logic, semantics, completeness, cut-elimination, resource models
16	Bao-Hong Shen, Shuiwang Ji, Jieping Ye	Mining discrete patterns via binary matrix factorization.	KDD	2009	DBLP DOI BibTeX RDF	binary matrix factorization, rank-one, regularization, integer linear program, maximum flow, minimum cut
16	Stanislav Zivný, David A. Cohen, Peter G. Jeavons	The Expressive Power of Binary Submodular Functions.	MFCS	2009	DBLP DOI BibTeX RDF	Decomposition of submodular functions, Pseudo-Boolean optimisation, Submodular function minimisation, Min-Cut
16	Xiaoyu Wu, Yangsheng Wang, Jituo Li	Video Background Segmentation Using Adaptive Background Models.	ICIAP	2009	DBLP DOI BibTeX RDF	Background segmentation, Adaptive graph cut, Background modeling
16	Atsushi Shimada, Rin-Ichiro Taniguchi	Elimination of Useless Neurons in Incremental Learnable Self-Organizing Map.	WSOM	2009	DBLP DOI BibTeX RDF	Elimination of Neurons, Self-Organizing Map, Graph Cut
16	Yu Sasaki, Kazumaro Aoki	Finding Preimages in Full MD5 Faster Than Exhaustive Search.	EUROCRYPT	2009	DBLP DOI BibTeX RDF	splice-and-cut, hash function, MD5, preimage, one-way, local collision
16	Dietmar Ebner, Bernhard Scholz, Andreas Krall	Progressive spill code placement.	CASES	2009	DBLP DOI BibTeX RDF	constrained min-cut, spilling, register allocation, SSA form
16	Kwang-Woo Lee, Yunho Lee, Seungjoo Kim, Dongho Won	A Practical Approach to a Reliable Electronic Election.	ICCSA (2)	2009	DBLP DOI BibTeX RDF	paper receipt, cut-and-choose, electronic voting
16	Abdelhameed Ibrahim, Shoji Tominaga, Takahiko Horiuchi	Material Classification for Printed Circuit Boards by Spectral Imaging System.	CCIW	2009	DBLP DOI BibTeX RDF	Spectral imaging system, material classification, spectral reflectance, k-means, printed circuit board, region segmentation, normalized cut
16	Xiaoming Liu 0004, Jun Liu 0011, Zhilin Feng	Colorization Using Segmentation with Random Walk.	CAIP	2009	DBLP DOI BibTeX RDF	image segmentation, random walks, colorization, graph cut
16	Mohammad Al Hasan, Krishna K. Ramachandran, John E. Mitchell 0001	Optimal placement of stereo sensors.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Sensors, Integer programming, GRASP, Branch-and-cut
16	Tin-Chi Lin, Dieter Vandenbussche	Box-constrained quadratic programs with fixed charge variables.	J. Glob. Optim.	2008	DBLP DOI BibTeX RDF	Global Optimization, Quadratic programming, Branch-and-cut
16	Jianning Wang, Manuel M. Oliveira, Haitao Zhang, Arie E. Kaufman	Reconstructing regular meshes from points.	Vis. Comput.	2008	DBLP DOI BibTeX RDF	Regular mesh, Point parameterization, Cut handling, Surface reconstruction
16	Douglas S. Altner, Özlem Ergun	Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts.	CPAIOR	2008	DBLP DOI BibTeX RDF	Reoptimization, Robust Minimum Cut, Maximum Flow
16	Sourav Chatterji, Ichitaro Yamazaki, Zhaojun Bai, Jonathan A. Eisen	CompostBin: A DNA Composition-Based Algorithm for Binning Environmental Shotgun Reads.	RECOMB	2008	DBLP DOI BibTeX RDF	weighted PCA, DNA composition metrics, Genome Signatures, Feature Extraction, Metagenomics, Normalized Cut, Binning
16	Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui	From Axioms to Analytic Rules in Nonclassical Logics.	LICS	2008	DBLP DOI BibTeX RDF	nonclassical logics, hypersequent calculi, semantic cut-elimination, sequent calculi
16	Qiong Wu 0003, Pierre Boulanger, Walter F. Bischof	Bi-layer video segmentation with foreground and background infrared illumination.	ACM Multimedia	2008	DBLP DOI BibTeX RDF	graph cut, video segmentation, relaxation labeling
16	Yu Sasaki, Kazumaro Aoki	A Preimage Attack for 52-Step HAS-160.	ICISC	2008	DBLP DOI BibTeX RDF	HAS-160, splice-and-cut, hash function, preimage, one-way, local collision
16	Dan R. Olsen Jr., Mitchell K. Harris	Edge-respecting brushes.	UIST	2008	DBLP DOI BibTeX RDF	flood-fill, intelligent scissors, least-cost painting, min-graph-cut, paint
16	Xi Zhang, Guiqing Li, Yunhui Xiong, Fenghua He	3D Mesh Segmentation Using Mean-Shifted Curvature.	GMP	2008	DBLP DOI BibTeX RDF	graph cut, curvature, mean-shift, Mesh segmentation
16	Guilherme Ottoni, David I. August	Communication optimizations for global multi-threaded instruction scheduling.	ASPLOS	2008	DBLP DOI BibTeX RDF	graph min-cut, communication, synchronization, data-flow analysis, multi-threading, instruction scheduling
16	Alessio Guglielmi	A system of interaction and structure.	ACM Trans. Comput. Log.	2007	DBLP DOI BibTeX RDF	mix rule, noncommutativity, pomset logic, symmetry, linear logic, cut elimination, self-duality, deep inference, Calculus of structures
16	Aleksandra Kislak-Malinowska	On the Logic of beta -pregroups.	Stud Logica	2007	DBLP DOI BibTeX RDF	?-pregroup, normalization theorem, cut elimination, Pregroup
16	Alain Billionnet, Sourour Elloumi	Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem.	Math. Program.	2007	DBLP DOI BibTeX RDF	Quadratic 0-1 optimization, Convex quadratic relaxation, Semidefinite positive relaxation, Experiments, Integer programming, Max-cut
16	Annie Foret	Pregroup Calculus as a Logic Functor.	WoLLIC	2007	DBLP DOI BibTeX RDF	Lambek Categorial Grammars, Logic Functor, Cut Elimination, Pregroups
16	Tung-Chieh Chen, Yi-Lin Chuang, Yao-Wen Chang	X-architecture placement based on effective wire models.	ISPD	2007	DBLP DOI BibTeX RDF	X architecture, partitioning, placement, physical design, Steiner tree, min cut, net weighting
16	Mario Sormann, Christopher Zach, Joachim Bauer, Konrad F. Karner, Horst Bischof	Watertight Multi-view Reconstruction Based on Volumetric Graph-Cuts.	SCIA	2007	DBLP DOI BibTeX RDF	volumetric 3D reconstruction, dense depth maps, virtual 3D models, graph-cut
16	Su Zhang 0001, Wei Yang 0033, Hongtao Lu, Yazhu Chen, Wenying Li, Yaqing Chen	Automatic Feature Extraction and Analysis on Breast Ultrasound Images.	ICIC (3)	2007	DBLP DOI BibTeX RDF	K-way Normalized cut, Local area integral invariant, Feature extraction, Shape analysis, Computer-aided diagnosis
16	Sanjeev Arora, Satyen Kale	A combinatorial, primal-dual approach to semidefinite programs.	STOC	2007	DBLP DOI BibTeX RDF	balanced separator, matrix multiplicative weights, min UnCut, semidefinite programming, sparsest cut
16	Ning Zhang 0023, Ling Guan	Graph Cuts in Content-Based Image Classification and Retrieval with Relevance Feedback.	PCM	2007	DBLP DOI BibTeX RDF	Maximum-flow/minimum-cut, Relevance Feedback, Content-based Image Retrieval, Radial Basis Function, Graph Cuts
16	Yufei Zha, Ying Chu, Duyan Bi	A Boosting Discriminative Model for Moving Cast Shadow Detection.	EMMCVPR	2007	DBLP DOI BibTeX RDF	Discriminative Random Fields, boosting, graph cut, Shadow detection
16	Ru-Xin Gao, Tianfu Wu 0001, Song Chun Zhu, Nong Sang	Bayesian Inference for Layer Representation with Mixed Markov Random Field.	EMMCVPR	2007	DBLP DOI BibTeX RDF	2.1D Sketch, Contour Completion, Mixed Markov Field, Swendsen-Wang Cut, Bayesian Inference, MCMC, Layer Representation
16	Sylvie Borne, Éric Gourdin, Bernard Liau, Ali Ridha Mahjoub	Design of survivable IP-over-optical networks.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	IP-over-optical network, Branch-and-Cut algorithm, Integer programming, Survivability
16	Jorge Riera-Ledesma, Juan José Salazar González	Solving the asymmetric traveling purchaser problem.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Traveling purchaser problem, Heuristics, Traveling salesman problem, Branch-and-cut
16	Pierre Geurts, Damien Ernst, Louis Wehenkel	Extremely randomized trees.	Mach. Learn.	2006	DBLP DOI BibTeX RDF	Decision and regression trees, Cut-point randomization, Bias/variance tradeoff, Kernel-based models, Supervised learning, Ensemble methods
16	Matthias Baaz, Rosalie Iemhoff	Gentzen Calculi for the Existence Predicate.	Stud Logica	2006	DBLP DOI BibTeX RDF	existence predicate, Gentzen calculus, truth-value logics, Gödel logics, Scott logics, cut-elimination, Intuitionistic logic, Kripke models, Skolemization
16	Xue-Bin Liang	Matrix games in the multicast networks: maximum information flows with network switching.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	achievable information rate regions, matrix games, max-flow min-cut theorems, maximum information flows, multisource multicast networks, network switching, route packings, switching gaps, game theory, network coding, multicast routes, set-covering problems
16	Hongyu Li, Wenbin Chen 0006, I-Fan Shen	Segmentation of Discrete Vector Fields.	IEEE Trans. Vis. Comput. Graph.	2006	DBLP DOI BibTeX RDF	Hodge decomposition, Green Function Method, vector field segmentation, approximation, contour, streamline, normalized cut
16	Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti	An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Steiner Arborescence, Prize Collecting, Network Design, Branch-and-Cut
16	Daniel Cohen-Or, Olga Sorkine, Ran Gal, Tommer Leyvand, Ying-Qing Xu	Color harmonization.	ACM Trans. Graph.	2006	DBLP DOI BibTeX RDF	color harmonization, computational aesthetics, image enhancement, cut-and-paste
16	Ming Leng, Songnian Yu, Yang Chen	An Effective Refinement Algorithm Based on Multilevel Paradigm for Graph Bipartitioning.	PROLAMAT	2006	DBLP DOI BibTeX RDF	multilevel paradigm, Tabu search, min-cut, graph bipartitioning
16	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	STOC	2006	DBLP DOI BibTeX RDF	edge-separator, single commodity max-flow, sparse cut, spectral method
16	Xin Zhou, Yunlong Xu, Gongming Chen, Zhigeng Pan	A New Wildcard Search Method for Digital Dictionary Based on Mobile Platform.	ICAT Workshops	2006	DBLP DOI BibTeX RDF	Trie tree, No-head wildcard, Cut-branch, Mobile phone, Wildcard
16	Henry Towsner	Epsilon substitution for transfinite induction.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF	Epsilon substitution, Cut elimination
16	Yun-Tao Jia, Shi-Min Hu 0001, Ralph R. Martin	Video completion using tracking and fragment merging.	Vis. Comput.	2005	DBLP DOI BibTeX RDF	Video completion, Tracking, Texture synthesis, Graph cut, Mean shift
16	Matthias Baaz, Rosalie Iemhoff	On Interpolation in Existence Logics.	LPAR	2005	DBLP DOI BibTeX RDF	existence predicate, Gentzen calculus, Beth definability, truth-value logics, Gödel logics, Scott logics, interpolation, cut-elimination, Intuitionistic logic, Kripke models, Skolemization
16	Jan Nesvadba, Fabian Ernst, Jernej Perhavc, Jenny Benois-Pineau, Laurent Primaux	Comparison of shot boundary detectors.	ICME	2005	DBLP DOI BibTeX RDF	video-processing technology, shot boundary detector, SBD, video cut detector, field-difference-based CD algorithm, spatio-temporal audiovisual segmentation, culture-diverse multigenre AV corpus
16	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Multicommodity flow, well-linked terminals, and routing problems.	STOC	2005	DBLP DOI BibTeX RDF	all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths
16	Fengmin Xu, Chengxian Xu	A Continuous Method for Solving Multiuser Detection in CDMA.	AAIM	2005	DBLP DOI BibTeX RDF	Penalty function method, Convex function, Max cut problem
16	Hande Yaman	Concentrator location in telecommunications.	4OR	2004	DBLP DOI BibTeX RDF	Concentrator location, polyhedral theory, branch and cut
16	Xueyan Tang, Samuel T. Chanson	Minimal Cost Replication of Dynamic Web Contents under Flat Update Delivery.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF	dynamic Web contents, maximum flow/minimum cut, Data replication, data consistency, object dependency, flow network
16	Vladimir Kolmogorov, Ramin Zabih	What Energy Functions Can Be Minimized via Graph Cuts?	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	optimization, Markov Random Fields, graph algorithms, Energy minimization, maximum flow, minimum cut
16	Stefano Baratella, Andrea Masini	An approach to infinitary temporal proof theory.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF	Modal logic, Proof theory, Sequent calculus, Cut elimination, Infinitary logic
16	Yin Li, Jian Sun 0001, Chi-Keung Tang, Heung-Yeung Shum	Lazy snapping.	ACM Trans. Graph.	2004	DBLP DOI BibTeX RDF	Image Cutout, User Interface, Graph Cut, Interactive Image Segmentation
16	Jinbo Xu, Ming Li 0001, Ying Xu 0001	Protein Threading by Linear Programming: Theoretical Analysis and Computational Results.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	CAFASP, integer program, branch-and-cut, cutting plane, protein threading
16	Alexander A. Ageev, Maxim Sviridenko	Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	rounding technique, maximum coverage, approximation algorithm, performance guarantee, max cut, linear relaxation
16	Mihai Osian, Luc Van Gool	Video shot characterization.	Mach. Vis. Appl.	2004	DBLP DOI BibTeX RDF	Shot cut detection, Motion estimation, Keyframe extraction
16	Ying Liu 0042, Alan P. Sprague, Elliot J. Lefkowitz	Network flow for outlier detection.	ACM Southeast Regional Conference	2004	DBLP DOI BibTeX RDF	Maximum Flow Minimum Cut, data mining, graph theory, network flow, outlier detection
16	Hiroshi Ishikawa 0002	Exact Optimization for Markov Random Fields with Convex Priors.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	global optimization, Markov random field, maximum flow, minimum cut
16	Hiroshi Nagamochi, Peter Eades	An Edge-Splitting Algorithm in Planar Graphs.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	edge splitting, planar graph, undirected graph, minimum cut, edge-connectivity, multigraph, outerplanar graph
16	Pablo Rey, Claudia A. Sagastizábal	Convex Normalizations in Lift-and-Project Methods for 0-1 Programming.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	disjunctive cuts, 0-1 integer programming, Branch-and-Cut, cutting planes, Lift-and-Project
16	C. D. Randazzo, Henrique Pacca Loureiro Luna	A Comparison of Optimal Methods for Local Access Uncapacitated Network Design.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	branch-and-bound, network design, branch-and-cut, Benders decomposition
16	Dianne R. Kumar, Walid A. Najjar, Pradip K. Srimani	A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	adaptive routing, Multicast communication, deterministic routing, virtual cut-through switching, path-based routing, tree-based routing
16	Dorit S. Hochbaum	An efficient algorithm for image segmentation, Markov random fields and related problems.	J. ACM	2001	DBLP DOI BibTeX RDF	parametric minimum cut, Markov random fields, Convex optimization, strongly polynomial algorithms
16	Hua Wang, Yanchuan Zhang	Untraceable Off-line Electronic Cash Flow in E-Commerce.	ACSC	2001	DBLP DOI BibTeX RDF	Cut-and-Choose technique, DLA, Hash function, Random oracle model, Electronic-cash
16	David W. Miller, Jinhua Guo, Eileen T. Kraemer, Yin Xiong	On-the-fly calculation and verification of consistent steering transactions.	SC	2001	DBLP DOI BibTeX RDF	consistent cut, consistent steering, consistent transaction, program event, program transaction, steering event, steering transaction, happened before
16	Ulrik Brandes, Dorothea Wagner	A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs.	Algorithmica	2000	DBLP DOI BibTeX RDF	Combinatorial optimization, Polyhedra, Branch-and-cut
16	Young-Joo Suh, Binh Vien Dao, José Duato, Sudhakar Yalamanchili	Software-Based Rerouting for Fault-Tolerant Pipelined Communication.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	E-cube routing, livelock freedom, fault tolerance, interconnection networks, multiprocessors, adaptive routing, wormhole switching, oblivious routing, deadlock freedom, virtual cut-through switching
16	Sugath Warnakulasuriya, Timothy Mark Pinkston	A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	Deadlock detection/resolution, network resource model, true fully-adaptive routing, virtual cut-through/wormhole switching, interconnection network
16	Mark D. Apperley, Dale Fletcher, William J. Rogers 0001	Breaking the Copy/Paste Cycle: The Stretchable Selection Tool.	AUIC	2000	DBLP DOI BibTeX RDF	Multiple Selection, Transparent Overlay, Augmented Pointer, Collaborative, Cut and Paste, Copy and Paste, Paste
16	Philippe Chatalic, Laurent Simon	Multi-resolution on compressed sets of clauses.	ICTAI	2000	DBLP DOI BibTeX RDF	compressed sets, compressed clauses, propositional clauses, compression power, structured instances, specialized operator, clause sets, polynomial size data structures, ZREs system, Davis-Putnam procedure, hard problems, SAT provers, zero-suppressed binary decision diagrams, computational complexity, data structures, data structures, data compression, theorem proving, computability, encodings, directed graphs, binary decision diagrams, set theory, multi-resolution, cut eliminations, ZBDDs
16	Laxmi Parida, Dan Geiger	Mass Estimation of DNA Molecules and Extraction of Ordered Restriction Maps in Optical Mapping Imagery.	Algorithmica	1999	DBLP DOI BibTeX RDF	Flip cut, Optical mapping, Shortest path algorithm
16	Stuart W. Daniel, Kang G. Shin, Sang Kyun Yun	A Router Architecture for Flexible Routing and Switching in Multihop Point-To-Point Networks.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	flexible routing and switching, Routers, switch architecture, cut-through switching
16	Jean Fonlupt, Ali Ridha Mahjoub	Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope.	IPCO	1999	DBLP DOI BibTeX RDF	2-edge connected graph, critical extreme point, Polytope, cut
16	Anupam Gupta 0001, Ilan Newman, Yuri Rabinovich, Alistair Sinclair	Cuts, Trees and l1-Embeddings of Graphs.	FOCS	1999	DBLP DOI BibTeX RDF	embeddings, Multicommodity flow, Sparsest cut, Finite metric spaces
16	Chong-Wah Ngo, Ting-Chuen Pong, Roland T. Chin	Camera Break Detection by Partitioning of 2D Spatio-Temporal Images in MPEG Domain.	ICMCS, Vol. 1	1999	DBLP DOI BibTeX RDF	spatio-temporal image segmentation, camera cut and wipe detection