Search results for "uncut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
106	Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev	O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems.	STOC	2005	DBLP DOI BibTeX RDF	directed balanced separator, directed sparsest cut, min 2CNF deletion, min UnCut, min multicut
92	Michael Langberg, Yuval Rabani, Chaitanya Swamy	Approximation Algorithms for Graph Homomorphism Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
83	Andy Brooks	Software process improvement uncut: interviews.	ACM SIGSOFT Softw. Eng. Notes	2006	DBLP DOI BibTeX RDF	interview guide, interview results, uncut, SPI, software process improvement
54	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
46	Subhash Khot, Nisheeth K. Vishnoi	The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1.	FOCS	2005	DBLP DOI BibTeX RDF
46	Gerold Jäger, Anand Srivastav	Improved Approximation Algorithms for Maximum Graph Partitioning Problems.	FSTTCS	2004	DBLP DOI BibTeX RDF
46	Eran Halperin, Uri Zwick	A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.	IPCO	2001	DBLP DOI BibTeX RDF
30	Rizky Mulya Sampurno, Zifu Liu, R. M. Rasika D. Abeyrathna, Tofael Ahamed	Intrarow Uncut Weed Detection Using You-Only-Look-Once Instance Segmentation for Orchard Plantations.	Sensors	2024	DBLP DOI BibTeX RDF
30	Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen	Two-sets cut-uncut on planar graphs.	CoRR	2023	DBLP DOI BibTeX RDF
30	Peng Zhang 0008, Zhendong Liu	Approximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
30	Peng Zhang 0008, Zhendong Liu	Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph.	AAIM	2020	DBLP DOI BibTeX RDF
30	Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian	Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection.	AISTATS	2020	DBLP BibTeX RDF
30	Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto, Euiwoong Lee, Mohammad Mahdian, Konstantin Makarychev, Grigory Yaroslavtsev	Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection.	CoRR	2019	DBLP BibTeX RDF
30	Qiang Guo, Ming Yang Zhang, Yan Jiang, Bo Zhao	The determination of instantaneous uncut chip thickness for non-uniform helix angle tools with complex tool path in ultrasonic milling process.	Int. J. Manuf. Res.	2018	DBLP DOI BibTeX RDF
30	Fiza Murtaza, Muhammad Haroon Yousaf, Sergio A. Velastin	PMHI: Proposals From Motion History Images for Temporal Segmentation of Long Uncut Videos.	IEEE Signal Process. Lett.	2018	DBLP DOI BibTeX RDF
30	Peng Zhang 0008, Chenchen Wu, Dachuan Xu	Approximation and hardness results for the Max k-Uncut problem.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
30	Hao Yang, Ke Xie 0001, Shengqiu Huang, Hui Huang 0004	Uncut Aerial Video via a Single Sketch.	Comput. Graph. Forum	2018	DBLP DOI BibTeX RDF
30	Pallavi Jain 0001, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh 0001	A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut.	GECCO (Companion)	2018	DBLP DOI BibTeX RDF
30	Kento Watanabe, Jun'ichi Kaneko, Kenichiro Horio	Development of Tool Collision Avoidance Method Adapted to Uncut Workpiece Shape.	Int. J. Autom. Technol.	2017	DBLP DOI BibTeX RDF
30	Weizhong Geng, Zhengming Chen, Kunjin He, Yunyan Wu	Feature recognition and volume generation of uncut regions for electrical discharge machining.	Adv. Eng. Softw.	2016	DBLP DOI BibTeX RDF
30	Chenchen Wu, Dachuan Xu, Donglei Du, Wen-qing Xu	An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding.	J. Comb. Optim.	2016	DBLP DOI BibTeX RDF
30	Peng Zhang 0008, Chenchen Wu, Dachuan Xu, Xinghe Zhang	Approximation and Hardness Results for the Max k-Uncut Problem.	COCOA	2016	DBLP DOI BibTeX RDF
30	Nadja Lederer, Thomas Grechenig, René Baranyi	unCUT: bridging the gap from paper diary cards towards mobile electronic monitoring solutions in borderline and self-injury.	SeGAH	2014	DBLP DOI BibTeX RDF
30	Chenchen Wu, Dachuan Xu, Donglei Du, Wen-qing Xu	A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem.	COCOON	2014	DBLP DOI BibTeX RDF
30	Abe Singer, Warren Anderson, Rik Farrow	Rethinking Password Policies (uncut).	login Usenix Mag.	2013	DBLP BibTeX RDF
30	Salimur Choudhury, Daya Ram Gaur, Ramesh Krishnamurti	An Approximation Algorithm for Max k-Uncut with Capacity Constraints.	CSO (2)	2009	DBLP DOI BibTeX RDF
30	Mohd Salman Abu Mansor, Srichand Hinduja, Oladele Owodunni	Voronoi diagram-based tool path compensations for removing uncut material in 21/2D pocket machining.	Comput. Aided Des.	2006	DBLP DOI BibTeX RDF
30	Sang C. Park, Byoung Kyu Choi	Uncut free pocketing tool-paths generation using pair-wise offset algorithm.	Comput. Aided Des.	2001	DBLP DOI BibTeX RDF
23	Gerold Jäger, Anand Srivastav	Improved Approximation Algorithms for Maximum Graph Partitioning Problems.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	maximum graph partitioning, semidefinite programming, approximation factor
23	Erik D. Demaine, Nicole Immorlica	Correlation Clustering with Partial Information.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF