Search results for "cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Conrad K. Kwok, Biswanath Mukherjee	Transparent (Cut-Through) Bridging of CSMA/CD Networks: Performance Analysis and Implementation.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	CSMA/CD networks, transparent bridge, transparent CSMA/CD bridge, cut-through bridge, performance evaluation, performance analysis, local area networks, local area networks, LANs, carrier sense multiple access
21	Frank P. Kelly, C. N. Laws	Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling.	Queueing Syst. Theory Appl.	1993	DBLP DOI BibTeX RDF	Brownian network models, resource pooling, threshold strategies, generalized cut constraints, heavy traffic analysis, pathwise solution, dynamic sequencing, shortest delay routing
21	Dilip D. Kandlur, Kang G. Shin	Traffic Routing for Multicomputer Networks with Virtual Cut-Through Capability.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	virtual cut-through capability, route selection problem, link cost function, C-wrapped hexagonal mesh, performance, computational complexity, hypercube, computer networks, NP-hard, hypercube networks, telecommunication network routing, interprocess communication, minimisation of switching nets, multicomputer networks, minimization problem, traffic routing, network load
21	Gopalakrishnan Vijayan	Generalization of Min-Cut Partitioning to Tree Structures and Its Applications.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	min-cut partitioning, hyperedges, VLSI design applications, iterative improvement heuristic, routing, computational complexity, data structures, trees (mathematics), hypergraph, minimisation, minimisation, tree structures, vertices, cost function, nodes, pins
21	James W. Dolter, Parameswaran Ramanathan, Kang G. Shin	Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	HARTS, hexagonal mesh multicomputer, C-wrapped, hexagonal architecture, simulator, performance evaluation, real-time systems, real-time systems, performance analysis, distributed processing, probability, computer architecture, analytic model, formal analysis, combinatorial mathematics, combinatorial analysis, virtual cut-through switching
21	Frank Thomson Leighton, Satish Rao	An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms	FOCS	1988	DBLP DOI BibTeX RDF	max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation
21	Olivier Goldschmidt, Dorit S. Hochbaum	Polynomial Algorithm for the k-Cut Problem	FOCS	1988	DBLP DOI BibTeX RDF	k-cut problem, edge weighted graph, k nonempty components, total edge weight, partition, NP-complete, NP hard, polynomial algorithm, vertex
20	José Espírito Santo	The lambda-Calculus and the Unity of Structural Proof Theory.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF
20	Yun-Che Wen	Test scheme for switched-capacitor circuits by digital analyses.	DDECS	2009	DBLP DOI BibTeX RDF
20	Navin Goyal, Luis Rademacher, Santosh S. Vempala	Expanders via random spanning trees.	SODA	2009	DBLP DOI BibTeX RDF
20	Rajeev Goré, Linda Postniece, Alwen Tiu	Taming Displayed Tense Logics Using Nested Sequents with Deep Inference.	TABLEAUX	2009	DBLP DOI BibTeX RDF
20	Moses Charikar, Konstantin Makarychev, Yury Makarychev	Integrality gaps for Sherali-Adams relaxations.	STOC	2009	DBLP DOI BibTeX RDF	Sherali-Adams hierarchy, lift-and-project methods, local-global metric spaces
20	Wenbing Tao, Hai Jin 0001, Yimin Zhang 0001, Liman Liu, Desheng Wang	Image Thresholding Using Graph Cuts.	IEEE Trans. Syst. Man Cybern. Part A	2008	DBLP DOI BibTeX RDF
20	Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth	Detecting cuts in sensor networks.	ACM Trans. Sens. Networks	2008	DBLP DOI BibTeX RDF	Distributed algorithms, computational geometry, network failure
20	Ugo V. Boscain, Francesco Rossi	Shortest paths on 3-D simple Lie groups with nonholonomic constraint.	CDC	2008	DBLP DOI BibTeX RDF
20	Frank Neumann 0001, Joachim Reichel, Martin Skutella	Computing minimum cuts by randomized search heuristics.	GECCO	2008	DBLP DOI BibTeX RDF	minimum s-t-cuts, evolutionary algorithms, multi-objective optimization, randomized search heuristics
20	Ailixier Aikebaier, Tomoya Enokido, Makoto Takizawa 0001	A Backward Algorithm in a Distributed Agreement Computing.	ICPADS	2008	DBLP DOI BibTeX RDF
20	M. A. El-Gamal, M. D. A. Mohamed	Ensembles of Neural Networks for Fault Diagnosis in Analog Circuits.	J. Electron. Test.	2007	DBLP DOI BibTeX RDF	fault simulation, boosting, ensemble learning, analog circuits, bagging, fault classification
20	Sudipta N. Sinha, Philippos Mordohai, Marc Pollefeys	Multi-View Stereo via Graph Cuts on the Dual of an Adaptive Tetrahedral Mesh.	ICCV	2007	DBLP DOI BibTeX RDF
20	Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch	Orbitopal Fixing.	IPCO	2007	DBLP DOI BibTeX RDF
20	Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi	Efficient algorithms for computing all low s-t edge connectivities and related problems.	SODA	2007	DBLP BibTeX RDF
20	James Brotherston, Alex Simpson	Complete Sequent Calculi for Induction and Infinite Descent.	LICS	2007	DBLP DOI BibTeX RDF
20	Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis	Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy.	FOCS	2007	DBLP DOI BibTeX RDF
20	Frank R. Schmidt, Eno Töppe, Daniel Cremers, Yuri Boykov	Efficient Shape Matching Via Graph Cuts.	EMMCVPR	2007	DBLP DOI BibTeX RDF
20	Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor	A general approach to online network optimization problems.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding
20	Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella	Length-Bounded Cuts and Flows.	ICALP (1)	2006	DBLP DOI BibTeX RDF
20	Olivier Juan, Yuri Boykov	Active Graph Cuts.	CVPR (1)	2006	DBLP DOI BibTeX RDF
20	Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr	Proof Transformation by CERES.	MKM	2006	DBLP DOI BibTeX RDF
20	Sieteng Soh, Suresh Rai	An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities.	IEEE Trans. Reliab.	2005	DBLP DOI BibTeX RDF
20	Sudipta N. Sinha, Marc Pollefeys	Multi-View Reconstruction Using Photo-consistency and Exact Silhouette Constraints: A Maximum-Flow Formulation.	ICCV	2005	DBLP DOI BibTeX RDF
20	Abhinav Gupta 0001, V. Shiv Naga Prasad, Larry S. Davis	Extracting regions of symmetry.	ICIP (3)	2005	DBLP DOI BibTeX RDF
20	George Karakostas	A Better Approximation Ratio for the Vertex Cover Problem.	ICALP	2005	DBLP DOI BibTeX RDF
20	Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis	A fast kernel-based multilevel algorithm for graph clustering.	KDD	2005	DBLP DOI BibTeX RDF	kernel methods, spectral clustering, graph clustering, multilevel methods
20	Wan-Chiu Li, Bruno Lévy 0001, Jean-Claude Paul	Mesh Editing with an Embedded Network of Curves.	SMI	2005	DBLP DOI BibTeX RDF
20	Prosenjit Bose, Stefan Langerman	Weighted Ham-Sandwich Cuts.	JCDCG	2004	DBLP DOI BibTeX RDF
20	Ashwin Raghunathan, Hongjoong Shin, Jacob A. Abraham, Abhijit Chatterjee	Prediction of Analog Performance Parameters Using Oscillation Based Test.	VTS	2004	DBLP DOI BibTeX RDF
20	Peng Wu, Hiromasa Suzuki, Joe Kuragano, Kiwamu Kase	Three-axis NC Cutter Path Generation for Subdivision Surface.	GMP	2004	DBLP DOI BibTeX RDF
20	Agata Ciabattoni, George Metcalfe	Bounded Lukasiewicz Logics.	TABLEAUX	2003	DBLP DOI BibTeX RDF
20	Reda Alhajj, Ashraf Elnagar	A Novel Approach to Separate Handwritten Connected Digits.	ICDAR	2003	DBLP DOI BibTeX RDF
20	Djamel A. Zighed, Stéphane Lallich, Fabrice Muhlenbach	Separability Index in Supervised Learning.	PKDD	2002	DBLP DOI BibTeX RDF
20	Romeo Rizzi	Excluding a Simple Good Pair Approach to Directed Cuts.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
20	Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki	A Unified Framework for Approximating Multiway Partition Problems.	ISAAC	2001	DBLP DOI BibTeX RDF
20	Alberto Caprara, Alessandro Panconesi, Romeo Rizzi	Packing Cycles and Cuts in Undirected Graphs.	ESA	2001	DBLP DOI BibTeX RDF
20	Alvernon Walker	A Step Response Based Mixed-Signal BIST Approach .	DFT	2001	DBLP DOI BibTeX RDF
20	Don-Lin Yang, Yeh-Ching Chung, Chih-Chang Chen, Ching-Jung Liao	A Dynamic Diffusion Optimization Method for Irregular Finite Element Graph Partitioning.	J. Supercomput.	2000	DBLP DOI BibTeX RDF	dynamic diffusion, irregular finite element graphs, load balancing, partition, mapping, distributed memory multicomputers
20	Leigh J. Fitzgibbon, Lloyd Allison, David L. Dowe	Minimum Message Length Grouping of Ordered Data.	ALT	2000	DBLP DOI BibTeX RDF
20	Lourdes Araujo	Towards Full Prolog on a Distributed Architecture.	Euro-Par	1997	DBLP DOI BibTeX RDF
20	Heebyung Yoon, Abhijit Chatterjee, Joseph L. A. Hughes	Optimal Design of Checksum-Based Checkers for Fault Detection in Linear Analog Circuits.	VLSI Design	1997	DBLP DOI BibTeX RDF
20	Abhijit Chatterjee, Bruce C. Kim, Naveena Nagi	Low-cost DC built-in self-test of linear analog circuits using checksums.	VLSI Design	1996	DBLP DOI BibTeX RDF	DC built-in self-test, catastrophic failures, line opens, DC transfer function, on-chip fault detection, BIST circuitry, fault diagnosis, built-in self test, integrated circuit testing, transfer functions, analogue integrated circuits, checksums, linear analog circuits, matrix representations, fault classes
20	Yukihiro Kamiya, Takayuki Miki, Yoshihiro Iwadare	Randomness Properties of Partial \gamma-\beta Planes as LSI Test Inputs and their Implementations.	AAECC	1995	DBLP DOI BibTeX RDF
20	Scott W. Hadley, Brian L. Mark, Anthony Vannelli	An efficient eigenvector approach for finding netlist partitions.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1992	DBLP DOI BibTeX RDF
20	Hari B. Bidasaria	Ray Tracing Surfaces of Revolution Using a Simplified Strip Tree Method (Abstract).	ACM Conference on Computer Science	1990	DBLP DOI BibTeX RDF
19	Rance D. Necaise, Richard H. Prosl	The color cut quantization algorithm.	ACM Southeast Regional Conference	2009	DBLP DOI BibTeX RDF	compression, quantization, dithering
19	Ghassan Hamarneh	Multi-label MRF Optimization via a Least Squares s - t Cut.	ISVC (1)	2009	DBLP DOI BibTeX RDF
19	Ondrej Danek, Pavel Matula, Carlos Ortiz-de-Solorzano, Arrate Muñoz-Barrutia, Martin Maska, Michal Kozubek 0001	Segmentation of Touching Cell Nuclei Using a Two-Stage Graph Cut Model.	SCIA	2009	DBLP DOI BibTeX RDF
19	Robert Görke, Tanja Hartmann, Dorothea Wagner	Dynamic Graph Clustering Using Minimum-Cut Trees.	WADS	2009	DBLP DOI BibTeX RDF
19	Matthias Prandtstetter, Günther R. Raidl	Meta-heuristics for reconstructing cross cut shredded text documents.	GECCO	2009	DBLP DOI BibTeX RDF	document reconstruction, ant colony optimization, integer linear programming, variable neighborhood search
19	Taiga Takata, Yusuke Matsunaga	An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs.	ACM Great Lakes Symposium on VLSI	2009	DBLP DOI BibTeX RDF	FPGA, logic synthesis, technology mapping
19	Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli	The capacitated max k -cut problem.	Math. Program.	2008	DBLP DOI BibTeX RDF
19	Jong-Sung Kim, Ki-Sang Hong	A new graph cut-based multiple active contour algorithm without initial contours and seed points.	Mach. Vis. Appl.	2008	DBLP DOI BibTeX RDF	Multiple active contours, Divisive partitioning, Image segmentation, Graph cuts
19	Plácido Rogério Pinheiro, José Aelio Silveira, João Batista Furlan, Clécio Tomaz, Ricardo Luiz Costa Hollanda Filho	A Novel Optimization in Guillotine Cut Applied Reel of Steel.	MCO	2008	DBLP DOI BibTeX RDF
19	Taiga Takata, Yusuke Matsunaga	Area recovery under depth constraint by Cut Substitution for technology mapping for LUT-based FPGAs.	ASP-DAC	2008	DBLP DOI BibTeX RDF
19	Yasushi Makihara, Yasushi Yagi	Silhouette extraction based on iterative spatio-temporal local color transformation and graph-cut segmentation.	ICPR	2008	DBLP DOI BibTeX RDF
19	Jahangir H. Sarker, Hussein T. Mouftah	Retransmission cut-off half-duplex slotted aloha for wireless ad hoc and sensor networks.	MOBIWAC	2008	DBLP DOI BibTeX RDF	half-duplex, node transmitting probability, number of retransmission attempts, algorithms, sensor, ad hoc, slotted aloha
19	Arnon Avron, Anna Zamansky	A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics.	CSR	2008	DBLP DOI BibTeX RDF
19	Sara Vicente, Vladimir Kolmogorov, Carsten Rother	Graph cut based image segmentation with connectivity priors.	CVPR	2008	DBLP DOI BibTeX RDF
19	Lu Liu 0012, David Raber, David Nopachai, Paul K. Commean, David R. Sinacore, Fred W. Prior, Robert Pless, Tao Ju	Interactive Separation of Segmented Bones in CT Volumes Using Graph Cut.	MICCAI (1)	2008	DBLP DOI BibTeX RDF
19	Norihiro Kamide	Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic.	CLIMA	2008	DBLP DOI BibTeX RDF
19	Jose Emmanuel Ramirez-Marquez, Bethel A. Gebre	A Classification Tree Based Approach for the Development of Minimal Cut and Path Vectors of a Capacitated Network.	IEEE Trans. Reliab.	2007	DBLP DOI BibTeX RDF
19	Hichem Sahbi, Jean-Yves Audibert, Renaud Keriven	Graph-Cut Transducers for Relevance Feedback in Content Based Image Retrieval.	ICCV	2007	DBLP DOI BibTeX RDF
19	Victor S. Lempitsky, Carsten Rother, Andrew Blake 0001	LogCut - Efficient Graph Cut Optimization for Markov Random Fields.	ICCV	2007	DBLP DOI BibTeX RDF
19	James G. Malcolm, Yogesh Rathi, Allen R. Tannenbaum	Graph Cut Segmentation with Nonlinear Shape Priors.	ICIP (4)	2007	DBLP DOI BibTeX RDF
19	Franz Rendl, Giovanni Rinaldi, Angelika Wiegele	A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.	IPCO	2007	DBLP DOI BibTeX RDF
19	Markus Behle, Michael Jünger, Frauke Liers	A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.	WEA	2007	DBLP DOI BibTeX RDF
19	Koji Nakazawa	An Isomorphism Between Cut-Elimination Procedure and Proof Reduction.	TLCA	2007	DBLP DOI BibTeX RDF
19	Jianer Chen, Yang Liu 0002, Songjian Lu	An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.	WADS	2007	DBLP DOI BibTeX RDF
19	James G. Malcolm, Yogesh Rathi, Allen R. Tannenbaum	A Graph Cut Approach to Image Segmentation in Tensor Space.	CVPR	2007	DBLP DOI BibTeX RDF
19	Olga Veksler	Graph Cut Based Optimization for MRFs with Truncated Convex Priors.	CVPR	2007	DBLP DOI BibTeX RDF
19	Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani	Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut.	STOC	2007	DBLP DOI BibTeX RDF	Lovasz-Schrijver hierarchy, approximation algorithms, linear programming, integrality gap
19	Ahlem Bouziri, Rym M'Hallah	A Hybrid Genetic Algorithm for the Cut Order Planning Problem.	IEA/AIE	2007	DBLP DOI BibTeX RDF	genetic algorithms, simulated annealing, hybrid heuristics
19	Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas	A Cut-Free and Invariant-Free Sequent Calculus for PLTL.	CSL	2007	DBLP DOI BibTeX RDF
19	Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh	On the Complexity of Finding an Unknown Cut Via Vertex Queries.	COCOON	2007	DBLP DOI BibTeX RDF
19	Jiahai Wang	A Memetic Algorithm with Genetic Particle Swarm Optimization and Neural Network for Maximum Cut Problems.	LSMS (1)	2007	DBLP DOI BibTeX RDF
19	Kyeong-Sik Min, Hun-Dae Choi, H.-Y. Choi, Hiroshi Kawaguchi 0001, Takayasu Sakurai	Leakage-suppressed clock-gating circuit with Zigzag Super Cut-off CMOS (ZSCCMOS) for leakage-dominant sub-70-nm and sub-1-V-VDD LSIs.	IEEE Trans. Very Large Scale Integr. Syst.	2006	DBLP DOI BibTeX RDF
19	Navaratnasothie Selvakkumaran, George Karypis	Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
19	Andrew B. Kahng, Sherief Reda	Wirelength minimization for min-cut placements via placement feedback.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
19	Gerhard Kramer, Serap A. Savari	Edge-Cut Bounds on Network Coding Rates.	J. Netw. Syst. Manag.	2006	DBLP DOI BibTeX RDF	d-separation, network coding, active networks, Network capacity
19	Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert	A branch-and-cut algorithm for multiple sequence alignment.	Math. Program.	2006	DBLP DOI BibTeX RDF
19	Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau	Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 90B10, 90C27, 90C57
19	Ricardo Fukasawa, Humberto J. Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck	Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 20E28, 20G40, 20C20
19	Ping-Teng Chang, Kuo-Chen Hung	α-cut fuzzy arithmetic: simplifying rules and a fuzzy function optimization with a decision variable.	IEEE Trans. Fuzzy Syst.	2006	DBLP DOI BibTeX RDF
19	Mirjana Borisavljevic	A Connection Between Cut Elimination and Normalization.	Arch. Math. Log.	2006	DBLP DOI BibTeX RDF
19	Mala L. Radhakrishnan, Sara L. Su	Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation.	ICIP	2006	DBLP DOI BibTeX RDF
19	Giulia Galbiati, Francesco Maffioli	Approximating Maximum Cut with Limited Unbalance.	WAOA	2006	DBLP DOI BibTeX RDF	approximation algorithm, randomized algorithm, semidefinite programming
19	Jiangjian Xiao, Xiaochun Cao, Hassan Foroosh	A new framework for video cut and paste.	MMM	2006	DBLP DOI BibTeX RDF
19	Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi	Integrality gaps for sparsest cut and minimum linear arrangement problems.	STOC	2006	DBLP DOI BibTeX RDF
19	Timothy Gatzke, Cindy Grimm	Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm.	GMP	2006	DBLP DOI BibTeX RDF
19	Christoph Buchheim, Lanbo Zheng	Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem.	COCOON	2006	DBLP DOI BibTeX RDF
19	Jung-Ho Ahn 0002, Hyeran Byun	Accurate Foreground Extraction Using Graph Cut with Trimap Estimation.	PSIVT	2006	DBLP DOI BibTeX RDF
19	Ameya R. Agnihotri, Satoshi Ono, Chen Li 0004, Mehmet Can Yildiz, Ateen Khatkhate, Cheng-Kok Koh, Patrick H. Madden	Mixed block placement via fractional cut recursive bisection.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2005	DBLP DOI BibTeX RDF