Search results for "minimum"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Henri Nicolas, Stéphane Pateux, Delphine Le Guen	Minimum Description Length Criterion for Region-Based Video Compression.	ICIP (1)	1997	DBLP DOI BibTeX RDF	minimum description length criterion, region-based video compression, MDL criterion, region-based motion compensation, partially coded, segmentation coding cost, data compression, video sequences, polygonal approximation, motion parameters, region-based segmentation, polygonal representation, displaced frame difference
18	Ten-Ho Lin, Von-Wun Soo	Pruning Fuzzy ARTMAP using the Minimum Description Length Principle in Learning from Clinical Databases.	ICTAI	1997	DBLP DOI BibTeX RDF	learning from database), minimum description length, fuzzy ARTMAP
18	Michalis Faloutsos, Mart L. Molle	What features really make distributed minimum spanning tree algorithms efficient?.	ICPADS	1996	DBLP DOI BibTeX RDF	distributed minimum spanning tree, Distributed Information, computational complexity, distributed algorithms, graph theory, multiprocessor interconnection networks, communication complexity, running times, performance improvement, complexity measures, message complexity
18	Mingui Sun, Robert J. Sclabassi	Symmetric wavelet edge detector of the minimum length.	ICIP	1995	DBLP DOI BibTeX RDF	symmetric wavelet edge detector, infinite support, minimum length, wavelet transforms, wavelet transform, edge detection, images, minimisation, digital filters, digital filters, computational cost, roundoff errors, truncation error, edge localization
18	Shashidhar Thakur, D. F. Wong 0001	Simultaneous area and delay minimum K-LUT mapping for K-exact networks.	ICCD	1995	DBLP DOI BibTeX RDF	area/delay minimum K-LUT mapping, K-exact networks, technology mapping problem, lookup table FPGAs, area minimization problem, K-bounded networks, delay minimization problem, flow-map algorithm, field programmable gate arrays, computational complexity, complexity, NP-complete, logic design, polynomial time algorithm, programmable logic arrays, table lookup, minimisation of switching nets
18	William S. Hiles, David T. Marlow	Approximation of FDDI minimum reconfiguration time.	LCN	1995	DBLP DOI BibTeX RDF	military communication, FDDI minimum reconfiguration time approximation, military platforms, reconfiguration timing, FDDI product testing, timing, data transfer, FDDI, military computing, LAN interconnection, mission critical systems, interconnection topologies
18	Erik McDermott, Shigeru Katagiri	Prototype-based minimum error training for speech recognition.	Appl. Intell.	1994	DBLP DOI BibTeX RDF	Minimum error training, speech recognition, pattern classification
18	Klaus Simon	On Minimum Flow and Transitive Reduction.	ICALP	1988	DBLP DOI BibTeX RDF	Minimum flow, transitive reduction, random digraph, transitive closure
18	Chen Tian 0001, Hongbo Jiang 0001, Xue Liu, Wenyu Liu 0001, Yi Wang 0049	Towards Minimum Traffic Cost and Minimum Response Latency: A Novel Dynamic Query Protocol in Unstructured P2P Networks.	ICPP	2008	DBLP DOI BibTeX RDF
18	Zhao Li, Wei Zhang, Hengchang Liu, Baohua Zhao, Yugui Qu	Multicast Routing with Minimum Energy Cost and Minimum Delay in Wireless Sensor Networks.	EUC Workshops	2005	DBLP DOI BibTeX RDF	MEMD multicast, MLST, Wireless Sensor Networks, STDMA
18	Miroslav Chlebík, Janka Chlebíková	Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching.	ISAAC	2003	DBLP DOI BibTeX RDF
18	Raffaele Mosca	A Property About Minimum Edge- and Minimum Clique-Cover of a Graph.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
18	Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki	Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.	ISAAC	1999	DBLP DOI BibTeX RDF
18	Boris Kryzhanovsky, Bashir M. Magomedov, Anatoly B. Fonarev	On the Probability of Finding Local Minima in Optimization Problems.	IJCNN	2006	DBLP DOI BibTeX RDF
18	Jinxiang Chai, Shing-Chow Chan, Heung-Yeung Shum, Xin Tong 0001	Plenoptic sampling.	SIGGRAPH	2000	DBLP DOI BibTeX RDF	plenoptic sampling, sampling, image-based rendering, spectral analysis, plenoptic functions
18	Maria C. Yuang, Yu G. Chen, M. T. Yen	Optimal multicast routing for ATM networks.	LCN	1995	DBLP DOI BibTeX RDF	optimal multicast routing algorithm, LOPT, load-sensitive networks, delay-sensitive, performance evaluation, computational complexity, computational complexity, asynchronous transfer mode, ATM networks, multicast routing, telecommunication network routing, multicast communication, delay bound
17	Johan M. M. van Rooij, Hans L. Bodlaender	Exact Algorithms for Edge Domination.	IWPEC	2008	DBLP DOI BibTeX RDF	minimum maximal matching, exponential time algorithms, measure and conquer, exact algorithms, edge dominating set
17	Alessandro Bissacco, Alessandro Chiuso, Stefano Soatto	Classification and Recognition of Dynamical Models: The Role of Phase, Independent Components, Kernels and Optimal Transport.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	Non-minimum Phase, Hammerstein models, Optimal Transport, Wasserstein models, Non-Gaussian models, Learning, Time Series, Kernel, Distance, System Identification, Higher-Order Statistics, Blind Deconvolution
17	Eva K. Lee, Todd Easton, Kapil Gupta	Novel evolutionary models and applications to sequence alignment problems.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Evolutionary distance problem, Minimum weight common mutated sequence, Node-packing polytope, Multiple sequence alignment, DNA sequencing, Sequence comparison, Conflict graph, Supernode, Phylogenetic analysis
17	Kun-Ming Yu, Jiayi Zhou, Chun-Yuan Lin, Chuan Yi Tang	An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR.	ISPA Workshops	2006	DBLP DOI BibTeX RDF	minimum ultrametric tree, parallel branch-and-bound algorithm, 3-point relationship, 4-point relationship, phylogenetic tree
17	Oguz Altun, Songül Albayrak, Ali Ekinci, Behzat Bükün	Turkish Fingerspelling Recognition System Using Axis of Least Inertia Based Fast Alignment.	Australian Conference on Artificial Intelligence	2006	DBLP DOI BibTeX RDF	Turkish Fingerspelling Recognition, Fast Alignment, Angle of orientation, Axis of Least Inertia, Minimum Bounding Square, Classification
17	Terence K. T. Law, John C. S. Lui, David K. Y. Yau	You Can Run, But You Can't Hide: An Effective Statistical Methodology to Trace Back DDoS Attackers.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	attack traffic filtering, minimum stable time, DDoS attack, traceback
17	Budhaditya Deb, Badri Nath	On the node-scheduling approach to topology control in ad hoc networks.	MobiHoc	2005	DBLP DOI BibTeX RDF	minimum virtual dominating sets, reliable packet delivery, ad-hoc networks, topology control, node scheduling
17	Yiwei Thomas Hou, Shivendra S. Panwar, Henry H.-Y. Tzeng	On Generalized Max-Min Rate Allocation and Distributed Convergence Algorithm for Packet Networks.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF	Max-min rate allocation, minimum rate, peak rate, centralized algorithm, distributed algorithm, convergence, flow control, packet networks
17	Chandra Chekuri, Sudipto Guha, Joseph Naor	Approximating Steiner k-Cuts.	ICALP	2003	DBLP DOI BibTeX RDF	Multiway Cut, $k$-Cut, Steiner tree, minimum cut, primal-dual
17	Timothy M. Chan	Euclidean bounded-degree spanning tree ratios.	SCG	2003	DBLP DOI BibTeX RDF	approximation, minimum spanning trees, discrete geometry
17	Carlo Gaibisso, Guido Proietti, Richard B. Tan	Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs.	COCOON	2003	DBLP DOI BibTeX RDF	Transient Node Failures, Radio Networks Survivability, Planar Graphs, Minimum Spanning Tree
17	Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni	Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach.	ICTCS	2001	DBLP DOI BibTeX RDF	Directed hypergraph, minimum weight hyperpath, dynamic algorithm, AND/OR graph
17	Zhanping Chen, Kaushik Roy 0001, Tan-Li Chou	Power sensitivity - a new method to estimate power dissipation considering uncertain specifications of primary inputs.	ICCAD	1997	DBLP DOI BibTeX RDF	Monte Carlo based approach, maximum bounds, minimum bounds, power dissipation estimation, power sensitivity, primary inputs, signal properties, signal switching, uncertain specifications, logic CAD, CMOS logic circuits, power estimation, CMOS circuits, signal probability, statistical technique
17	Rachid Sammouda, Noboru Niki, Hiromu Nishitani	Multichannel segmentation of magnetic resonance cerebral images based on neural networks.	ICIP	1995	DBLP DOI BibTeX RDF	multichannel segmentation, magnetic resonance cerebral images, cost-term, energy function minimization, temporary noise, metastaric tumor, neural networks, image segmentation, convergence, medical image processing, minimisation, brain, brain, Hopfield neural network, convergence of numerical methods, biomedical NMR, Hopfield neural nets, global minimum
17	Mayez A. Al-Mouhamed	Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	precedence graphs, earliest starting time, task delay, finish time, minimum time increase, interprocessor communication links, optimum performance, small graphs, scheduling, scheduling, graph theory, lower bounds, communication costs, task graph, completion time, time interval
16	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
16	Jean Cardinal, Samuel Fiorini, Gwenaël Joret	Tight Results on Minimum Entropy Set Cover.	Algorithmica	2008	DBLP DOI BibTeX RDF	Entropy, Greedy algorithm, Hardness of approximation, Set cover
16	Jean Cardinal, Samuel Fiorini, Gwenaël Joret	Minimum entropy coloring.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Complexity, Entropy, Graph coloring
16	Mingyu Xiao 0001	Finding Minimum 3-Way Cuts in Hypergraphs.	TAMC	2008	DBLP DOI BibTeX RDF
16	Giuseppe Valenzise, Marco Tagliasacchi, Stefano Tubaro	Minimum variance multiplexing of multimedia objects.	ICASSP	2008	DBLP DOI BibTeX RDF
16	Mei Wang, Guohong Wang	An Optimization Algorithm of Vehicle License Plate Correction Based on Minimum Projection Distance.	ICYCS	2008	DBLP DOI BibTeX RDF
16	Boris Kryzhanovsky, Vladimir Kryzhanovsky	Binary Optimization: On the Probability of a Local Minimum Detection in Random Search.	ICAISC	2008	DBLP DOI BibTeX RDF
16	Md. Abul Hassan Samee, Md. Jawaherul Alam, Muhammad Abdullah Adnan, Md. Saidur Rahman 0001	Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three.	GD	2008	DBLP DOI BibTeX RDF
16	Arvind Gupta, Mehdi Karimi 0001, Eun Jung Kim 0002, Arash Rafiey	Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs.	COCOA	2008	DBLP DOI BibTeX RDF
16	Mikkel Thorup	Minimum k-way cuts via deterministic greedy tree packing.	STOC	2008	DBLP DOI BibTeX RDF	k-way cuts, tree packing
16	Sebastian Böcker, Quang Bao Anh Bui, Anke Truß	An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees.	IWPEC	2008	DBLP DOI BibTeX RDF
16	Alex Rogers, Esther David, Nicholas R. Jennings, Jeremy Schiff	The effects of proxy bidding and minimum bid increments within eBay auctions.	ACM Trans. Web	2007	DBLP DOI BibTeX RDF	bid increment, proxy bidding, sniping, electronic commerce, Online auctions
16	Sanjiv Kapoor, Mohammad Sarwat	Bounded-Diameter Minimum-Cost Graph Problems.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
16	Chien Yao, Po-Ning Chen, Tsang-Yi Wang, Yunghsiang S. Han, Pramod K. Varshney	Performance Analysis and Code Design for Minimum Hamming Distance Fusion in Wireless Sensor Networks.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
16	Federico Mancini 0001	Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs.	ISAAC	2007	DBLP DOI BibTeX RDF
16	Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh	Compacting cuts: a new linear formulation for minimum cut.	SODA	2007	DBLP BibTeX RDF
16	Minh N. Doan	An effective ant-based algorithm for the degree-constrained minimum spanning tree problem.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
16	Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001	New Approximation Algorithms for Minimum Cycle Bases of Graphs.	STACS	2007	DBLP DOI BibTeX RDF
16	Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski	Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
16	Yang Yang 0012, Mingen Lin, Jinhui Xu 0001, Yulai Xie	Minimum Spanning Tree with Neighborhoods.	AAIM	2007	DBLP DOI BibTeX RDF
16	Kaviraj Chopra, Sarma B. K. Vrudhula	Efficient Symbolic Algorithms for Computing the Minimum and Bounded Leakage States.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
16	Toshihiro Fujito	How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover.	ICALP (1)	2006	DBLP DOI BibTeX RDF
16	Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn	A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.	ICALP (1)	2006	DBLP DOI BibTeX RDF
16	Hee-Sang Ko, Kwang Y. Lee, Min-Jae Kang, Ho-Chan Kim	Generalized Minimum Variance Neuro Controller for Power System Stabilization.	ISNN (2)	2006	DBLP DOI BibTeX RDF
16	Jungsik Lee, Ravi Sankar	Theoretical Derivation of Minimum Mean Square Error of RBF Based Equalizer.	ICNC (1)	2006	DBLP DOI BibTeX RDF
16	Takeya Shigezumi	Robustness of Greedy Type Minimum Evolution Algorithms.	International Conference on Computational Science (2)	2006	DBLP DOI BibTeX RDF
16	Mohammad Taghi Hajiaghayi, Kamal Jain, Lap Chi Lau, Ion I. Mandoiu, Alexander Russell, Vijay V. Vazirani	Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping.	International Conference on Computational Science (2)	2006	DBLP DOI BibTeX RDF
16	Oleksandr Grygorash, Yan Zhou, Zach Jorgensen	Minimum Spanning Tree Based Clustering Algorithms.	ICTAI	2006	DBLP DOI BibTeX RDF
16	Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri	Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks.	SIROCCO	2006	DBLP DOI BibTeX RDF
16	Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser	Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Jean Cardinal, Samuel Fiorini, Gwenaël Joret	Tight Results on Minimum Entropy Set Cover.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Ashish Kumar Singh, Murari Mani, Ruchir Puri, Michael Orshansky	Gain-based technology mapping for minimum runtime leakage under input vector uncertainty.	DAC	2006	DBLP DOI BibTeX RDF	leakage, technology mapping, logical effort
16	Mamatha Rudrapatna, Arcot Sowmya	Feature Weighted Minimum Distance Classifier with Multi-class Confidence Estimation.	Australian Conference on Artificial Intelligence	2006	DBLP DOI BibTeX RDF
16	Jie Wu 0001, Zhen Jiang	On constructing the minimum orthogonal convex polygon for the fault-tolerant routing in 2-D faulty meshes.	IEEE Trans. Reliab.	2005	DBLP DOI BibTeX RDF
16	Longjiang Guo, Weili Wu 0001, Feng Wang 0002, My T. Thai	An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	splitting/nonsplitting node, multicast, optical network
16	Jean Cardinal, Samuel Fiorini, Gwenaël Joret	Minimum Entropy Coloring.	ISAAC	2005	DBLP DOI BibTeX RDF
16	André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao	Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.	ESA	2005	DBLP DOI BibTeX RDF
16	Noseong Park, Daeyoung Kim 0001, Yoonmee Doh, Sangsoo Lee, Ji-tae Kim	An Optimal and Lightweight Routing for Minimum Energy Consumption in Wireless Sensor Networks.	RTCSA	2005	DBLP DOI BibTeX RDF
16	Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir, Ravi Sundaram	Minimum energy accumulative routing in wireless networks.	INFOCOM	2005	DBLP DOI BibTeX RDF
16	Rasmus Andersen, Brian Vinter	Transparent Remote File Access in the Minimum Intrusion Grid.	WETICE	2005	DBLP DOI BibTeX RDF
16	Victor Chepoi, Karim Nouioua, Yann Vaxès	A Rounding Algorithm for Approximating Minimum Manhattan Networks.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Aditya Dua, Uday B. Desai, Ranjan K. Mallik	Minimum probability of error-based methods for adaptive multiuser detection in multipath DS-CDMA channels.	IEEE Trans. Wirel. Commun.	2004	DBLP DOI BibTeX RDF
16	Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger	The Computational Complexity of the Minimum Weight Processor Assignment Problem.	WG	2004	DBLP DOI BibTeX RDF
16	Jie Wu 0001, Zhen Jiang	On Constructing the Minimum Orthogonal Convex Polygon in 2-D Faulty Meshes.	IPDPS	2004	DBLP DOI BibTeX RDF
16	Xiaoming Chen, Zheng Tang, Xinshun Xu, Songsong Li, Guangpu Xia, Jiahai Wang	An Algorithm Based on Hopfield Network Learning for Minimum Vertex Cover Problem.	ISNN (1)	2004	DBLP DOI BibTeX RDF
16	Yeong-Chyi Lee, Tzung-Pei Hong, Wen-Yang Lin	Mining Fuzzy Association Rules with Multiple Minimum Supports Using Maximum Constraints.	KES	2004	DBLP DOI BibTeX RDF
16	Kaviraj Chopra, Sarma B. K. Vrudhula, Sarvesh Bhardwaj	Efficient Algorithms for Identifying the Minimum Leakage States in CMOS Combinational Logic.	VLSI Design	2004	DBLP DOI BibTeX RDF
16	Andrew Lim 0001, Fan Wang 0003, Zhou Xu 0001	On the Selection and Assignment with Minimum Quantity Commitments.	COCOON	2004	DBLP DOI BibTeX RDF
16	Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany	The Minimum Shift Design Problem: Theory and Practice.	ESA	2003	DBLP DOI BibTeX RDF
16	Sudipta Sengupta	Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection.	WADS	2003	DBLP DOI BibTeX RDF
16	Seth Pettie, Vijaya Ramachandran	Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms.	SODA	2002	DBLP BibTeX RDF
16	Binay K. Bhattacharya, Asish Mukhopadhyay	On the Minimum Perimeter Triangle Enclosing a Convex Polygon.	JCDCG	2002	DBLP DOI BibTeX RDF
16	Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison	Change-Point Estimation Using New Minimum Message Length Approximations.	PRICAI	2002	DBLP DOI BibTeX RDF
16	Refael Hassin, Asaf Levin	Minimum Restricted Diameter Spanning Trees.	APPROX	2002	DBLP DOI BibTeX RDF
16	Yaw-Ling Lin, Fang-Rong Hsu, Yin-Te Tsai	Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs.	COCOON	2000	DBLP DOI BibTeX RDF
16	Shien-Ching Hwang, Gen-Huey Chen	The Minimum Spanner Problem on Butterfly Graphs.	ISPAN	2000	DBLP DOI BibTeX RDF
16	Sung Deuk Kim, Jong Beom Ra	An efficient motion vector coding scheme based on minimum bitrate prediction.	IEEE Trans. Image Process.	1999	DBLP DOI BibTeX RDF
16	Cao An Wang, Bo-Ting Yang	A Tight Bound for ß-SKeleton of Minimum Weight Triangulations.	WADS	1999	DBLP DOI BibTeX RDF
16	Guo-Hui Lin, Guoliang Xue, Defang Zhou	Approximating Hexagonal Steiner Minimal Trees by Fast Optimal Layout of Minimum Spanning Trees.	ICCD	1999	DBLP DOI BibTeX RDF	VLSI physical design, hexagonal routing, approximation algorithms
16	Vishwani D. Agrawal, Michael L. Bushnell, Ganapathy Parthasarathy, Rajesh Ramadoss	Digital Circuit Design for Minimum Transient Energy and a Linear Programming Method.	VLSI Design	1999	DBLP DOI BibTeX RDF
16	Alexander V. Karzanov	A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90C27, 90B10
16	Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein 0001	An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow.	IPCO	1998	DBLP DOI BibTeX RDF
16	Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi	Minimum Propositional Proof Length is NP-Hard to Linearly Approximate.	MFCS	1998	DBLP DOI BibTeX RDF
16	Wai-Kei Mak, Martin D. F. Wong	Minimum replication min-cut partitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
16	Amotz Bar-Noy, Guy Kortsarz	The Minimum Color Sum of Bipartite Graphs.	ICALP	1997	DBLP DOI BibTeX RDF
16	Chor Ping Low, Hon Wai Leong	Minimum fault coverage in memory arrays: a fast algorithm and probabilistic analysis.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
16	Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristán, Steven Skiena, Tae-Heng Yang	On Minimum-Area Hulls (Extended Abstract).	ESA	1996	DBLP DOI BibTeX RDF
16	Wai-Kei Mak, D. F. Wong 0001	Minimum replication min-cut partitioning.	ICCAD	1996	DBLP DOI BibTeX RDF	min-cut partitioning, circuit partitioning, logic replication
16	Jianxiu Hao, James B. Orlin	A Faster Algorithm for Finding the Minimum Cut in a Graph.	SODA	1992	DBLP BibTeX RDF