Search results for "separators"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Dana S. Richards	Finding Short Cycles in Planar Graphs Using Separators.	J. Algorithms	1986	DBLP DOI BibTeX RDF
18	Zvi Galil, Ravi Kannan, Endre Szemerédi	On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines	STOC	1986	DBLP DOI BibTeX RDF
18	Robert Endre Tarjan	Decomposition by clique separators.	Discret. Math.	1985	DBLP DOI BibTeX RDF
18	Edward T. Ordman	Mimimal threshold separators and memory requirements for synchronization (abstract only).	ACM Conference on Computer Science	1985	DBLP DOI BibTeX RDF
18	Gary L. Miller	Finding Small Simple Cycle Separators for 2-Connected Planar Graphs	STOC	1984	DBLP DOI BibTeX RDF
18	Kurt Mehlhorn, Bernd H. Schmidt	A Single Shortest Path Algorithm for Graphs with Separators.	FCT	1983	DBLP DOI BibTeX RDF
13	Dániel Marx	Tractable hypergraph properties for constraint satisfaction and conjunctive queries.	STOC	2010	DBLP DOI BibTeX RDF	submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability
13	Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri	Low depth cache-oblivious algorithms.	SPAA	2010	DBLP DOI BibTeX RDF	sparse-matrix vector multiply, schedulers, parallel algorithms, multiprocessors, sorting, graph algorithms, cache-oblivious algorithms
13	Sandrine Blazy, Benoît Robillard	Live-range unsplitting for faster optimal coalescing.	LCTES	2009	DBLP DOI BibTeX RDF	register allocation, graph reduction, coalescing
13	Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca	Constructing Brambles.	MFCS	2009	DBLP DOI BibTeX RDF
13	Leonidas Linardakis, Nikos Chrisochoides	Algorithm 870: A static geometric Medial Axis domain decomposition in 2D Euclidean space.	ACM Trans. Math. Softw.	2008	DBLP DOI BibTeX RDF	parallel mesh generation, Delaunay triangulation, Domain decomposition
13	Jacob E. Goodman, Richard Pollack	The combinatorial encoding of disjoint convex sets in the plane.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52A35, 52C30
13	Ziv Bar-Yossef, Ido Guy, Ronny Lempel, Yoëlle S. Maarek, Vladimir Soroka	Cluster ranking with an application to mining mailbox networks.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Clustering, Communities, Social networks, Ranking, Graph algorithms, Social network analysis
13	Martin Holzer 0001, Frank Schulz 0001, Dorothea Wagner	Engineering multilevel overlay graphs for shortest-path queries.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	overlay graph, vertex selection, shortest path, preprocessing, hierarchical, Dijkstra's algorithm, multilevel, speed-up technique
13	Jonathan Eckstein, Benar Fux Svaiter	A family of projective splitting methods for the sum of two maximal monotone operators.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 47H05, 90C25, 49M27
13	Georg Pölzlbauer, Thomas Lidy, Andreas Rauber	Decision Manifolds - A Supervised Learning Algorithm Based on Self-Organization.	IEEE Trans. Neural Networks	2008	DBLP DOI BibTeX RDF
13	Haytham Yaghi, Hamid Krim	Probabilistic graph matching by canonical decomposition.	ICIP	2008	DBLP DOI BibTeX RDF
13	Qiang Fu, Arindam Banerjee 0001	Multiplicative Mixture Models for Overlapping Clustering.	ICDM	2008	DBLP DOI BibTeX RDF
13	Timothy M. Chan, Eric Y. Chen	In-place 2-d nearest neighbor search.	SODA	2008	DBLP BibTeX RDF
13	Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos	Catalan structures and dynamic programming in H-minor-free graphs.	SODA	2008	DBLP BibTeX RDF
13	Richard Nock, Frank Nielsen	Intrinsic Geometries in Learning.	ETVC	2008	DBLP DOI BibTeX RDF
13	Fedor V. Fomin, Yngve Villanger	Treewidth Computation and Extremal Combinatorics.	ICALP (1)	2008	DBLP DOI BibTeX RDF
13	Jacob Fox, János Pach	Coloring kk-free intersection graphs of geometric objects in the plane.	SCG	2008	DBLP DOI BibTeX RDF	quasi-planar, string graph, chromatic number, topological graph, intersection graph
13	Richard Nock, Frank Nielsen	On the efficient minimization of convex surrogates in supervised learning.	ICPR	2008	DBLP DOI BibTeX RDF
13	Johannes Köbler, Oleg Verbitsky 0001	From Invariants to Canonization in Parallel.	CSR	2008	DBLP DOI BibTeX RDF
13	Ahmed M. Amin, Mithuna Thottethodi, T. N. Vijaykumar, Steven Wereley, Stephen C. Jacobson	Automatic volume management for programmable microfluidics.	PLDI	2008	DBLP DOI BibTeX RDF	fluid volume management, programmable lab on a chip, microfluidics
13	Isidro B. Nieto, Refugio Vallejo	A decision boundary hyperplane for the vector space of conics using a polinomial kernel in m-Euclidean space.	IJCNN	2008	DBLP DOI BibTeX RDF
13	Saeedeh Bakhshi, Hamid Sarbazi-Azad	Efficient VLSI Layout of Edge Product Networks.	DELTA	2008	DBLP DOI BibTeX RDF	Edge graph product, Collinear layout, Interconnection networks, Networks on chip, VLSI layout
13	Wei Wang 0028, Zhi-Hua Zhou	On multi-view active learning and the combination with semi-supervised learning.	ICML	2008	DBLP DOI BibTeX RDF
13	Alexander Grigoriev, Hans L. Bodlaender	Algorithms for Graphs Embeddable with Few Crossings per Edge.	Algorithmica	2007	DBLP DOI BibTeX RDF
13	Falk Hüffner, Nadja Betzler, Rolf Niedermeier	Optimal Edge Deletions for Signed Graph Balancing.	WEA	2007	DBLP DOI BibTeX RDF
13	Laurent Flindt Muller, Martin Zachariasen	Fast and Compact Oracles for Approximate Distances in Planar Graphs.	ESA	2007	DBLP DOI BibTeX RDF
13	Frederic Dorn	How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms.	WG	2007	DBLP DOI BibTeX RDF
13	Martin Fürer, Shiva Prasad Kasiviswanathan	Spanners for Geometric Intersection Graphs.	WADS	2007	DBLP DOI BibTeX RDF
13	Magnús M. Halldórsson, Christian Knauer, Andreas Spillner 0001, Takeshi Tokuyama	Fixed-Parameter Tractability for Non-Crossing Spanning Trees.	WADS	2007	DBLP DOI BibTeX RDF
13	Lior Wolf, Hueihan Jhuang, Tamir Hazan	Modeling Appearances with Low-Rank SVM.	CVPR	2007	DBLP DOI BibTeX RDF
13	Maciej Paszynski	Performance of Multi Level Parallel Direct Solver for hpFinite Element Method.	PPAM	2007	DBLP DOI BibTeX RDF	Parallel direct solvers, Substructuring method, Finite Element Method, hp adaptivity
13	Jiangde Yu, Xiaozhong Fan	Metadata Extraction from Chinese Research Papers Based on Conditional Random Fields.	FSKD (1)	2007	DBLP DOI BibTeX RDF
13	Maria-Florina Balcan, Andrei Z. Broder, Tong Zhang 0001	Margin Based Active Learning.	COLT	2007	DBLP DOI BibTeX RDF
13	Young June Pyun, Douglas S. Reeves	Strategic deployment of network monitors for attack attribution.	BROADNETS	2007	DBLP DOI BibTeX RDF
13	Chung Ho Chan, Howard Leung, Taku Komura	Automatic Panel Extraction of Color Comic Images.	PCM	2007	DBLP DOI BibTeX RDF	Comic processing, panel extraction, image segmentation, image analysis
13	Ahmed M. Amin, Mithuna Thottethodi, T. N. Vijaykumar, Steven Wereley, Stephen C. Jacobson	Aquacore: a programmable architecture for microfluidics.	ISCA	2007	DBLP DOI BibTeX RDF	fluidic, fluidic microarchitecture, programmable lab on a chip, microfluidics, instruction set
13	Hai-Feng Guo, Jalal Mahmud, Yevgen Borodin, Amanda Stent, I. V. Ramakrishnan	A General Approach for Partitioning Web Page Content Based on Geometric and Style Information.	ICDAR	2007	DBLP DOI BibTeX RDF
13	Ryan Magargle, James F. Hoburg, Tamal Mukherjee	Microfluidic Injector Models Based on Artificial Neural Networks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
13	Clément Chatelain 0001, Laurent Heutte, Thierry Paquet	Segmentation-Driven Recognition Applied to Numerical Field Extraction from Handwritten Incoming Mail Documents.	Document Analysis Systems	2006	DBLP DOI BibTeX RDF
13	Tobias Polzin, Siavash Vahdati Daneshmand	Practical Partitioning-Based Methods for the Steiner Problem.	WEA	2006	DBLP DOI BibTeX RDF
13	David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng	On Probe Permutation Graphs.	TAMC	2006	DBLP DOI BibTeX RDF
13	Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos	On Exact Algorithms for Treewidth.	ESA	2006	DBLP DOI BibTeX RDF
13	Ramana Isukapalli, Ahmed M. Elgammal, Russell Greiner	Learning Policies for Efficiently Identifying Objects of Many Classes.	ICPR (3)	2006	DBLP DOI BibTeX RDF
13	Feng Zhao, Xicheng Lu, Peidong Zhu, Jinjing Zhao	BGPSep_S: An Algorithm for Constructing IBGP Configurations with Complete Visibility.	ICDCN	2006	DBLP DOI BibTeX RDF
13	Christophe Paul, Andrzej Proskurowski, Jan Arne Telle	Generation of Graphs with Bounded Branchwidth.	WG	2006	DBLP DOI BibTeX RDF
13	David Tolliver, Gary L. Miller	Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering.	CVPR (1)	2006	DBLP DOI BibTeX RDF
13	Sharath R. Cholleti, Sally A. Goldman, Rouhollah Rahmani	MI-Winnow: A New Multiple-Instance Learning Algorithm.	ICTAI	2006	DBLP DOI BibTeX RDF
13	Vladislav Kubon, Markéta Lopatková, Martin Plátek, Patrice Pognan	Segmentation of Complex Sentences.	TSD	2006	DBLP DOI BibTeX RDF
13	Maria-Florina Balcan, Alina Beygelzimer, John Langford 0001	Agnostic active learning.	ICML	2006	DBLP DOI BibTeX RDF
13	Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chapelle	Deterministic annealing for semi-supervised kernel machines.	ICML	2006	DBLP DOI BibTeX RDF
13	Koji Eguchi, W. Bruce Croft	Query Structuring with Two-Stage Term Dependence in the Japanese Language.	AIRS	2006	DBLP DOI BibTeX RDF
13	Cid C. de Souza, Egon Balas	The vertex separator problem: algorithms and computations.	Math. Program.	2005	DBLP DOI BibTeX RDF
13	Giovanna Neve, Nicola Orio	A Comparison of Melodic Segmentation Techniques for Music Information Retrieval.	ECDL	2005	DBLP DOI BibTeX RDF
13	Erik D. Demaine, Mohammad Taghi Hajiaghayi	Bidimensionality: new connections between FPT algorithms and PTASs.	SODA	2005	DBLP BibTeX RDF
13	Christophe Paul, Jan Arne Telle	New Tools and Simpler Algorithms for Branchwidth.	ESA	2005	DBLP DOI BibTeX RDF
13	Akira Matsubayashi	Small congestion embedding of separable graphs into grids of the same size.	ISCAS (2)	2005	DBLP DOI BibTeX RDF
13	Sanjoy Dasgupta, Adam Tauman Kalai, Claire Monteleoni	Analysis of Perceptron-Based Active Learning.	COLT	2005	DBLP DOI BibTeX RDF
13	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
13	Fedor V. Fomin, Dieter Kratsch, Ioan Todinca	Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In.	ICALP	2004	DBLP DOI BibTeX RDF
13	Abraham Flaxman, Alan M. Frieze, Juan Vera 0001	A Geometric Preferential Attachment Model of Networks.	WAW	2004	DBLP DOI BibTeX RDF
13	Saikat Mukherjee, I. V. Ramakrishnan	Taming the Unstructured: Creating Structured Content from Partially Labeled Schematic Text Sequences.	CoopIS/DOA/ODBASE (2)	2004	DBLP DOI BibTeX RDF
13	Wei Li 0002, Peter van Beek	Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition.	ICTAI	2004	DBLP DOI BibTeX RDF
13	Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh	Approximating Geometric Bottleneck Shortest Paths.	STACS	2003	DBLP DOI BibTeX RDF
13	Eyal Amir, Robert Krauthgamer, Satish Rao	Constant factor approximation of vertex-cuts in planar graphs.	STOC	2003	DBLP DOI BibTeX RDF	balanced cut, planar separator, quotient cut, vertex separator, approximation algorithms, planar graph
13	Mauricio Marín, Gonzalo Navarro 0001	Distributed Query Processing Using Suffix Arrays.	SPIRE	2003	DBLP DOI BibTeX RDF
13	Anupam Gupta 0001, Amit Kumar 0001, Mikkel Thorup	Tree based MPLS routing.	SPAA	2003	DBLP DOI BibTeX RDF	MPLS routing, networks, routing algorithms
13	Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller	A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems.	Algorithmica	2002	DBLP DOI BibTeX RDF	Asteroidal triple, Minimum fill-in, Vertex ranking, Algorithm, Complexity, Graph, Treewidth
13	Yalin Wang 0001, Ihsin T. Phillips, Robert M. Haralick	Table Detection via Probability Optimization.	Document Analysis Systems	2002	DBLP DOI BibTeX RDF
13	Hwanjo Yu, Kevin Chen-Chuan Chang, Jiawei Han 0001	Heterogeneous Learner for Web Page Classification.	ICDM	2002	DBLP DOI BibTeX RDF
13	Stephen Tomlinson	Experiments in 8 European Languages with Hummingbird SearchServerTM at CLEF 2002.	CLEF	2002	DBLP DOI BibTeX RDF
13	Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari	Partitioning Planar Graphs with Costs and Weights.	ALENEX	2002	DBLP DOI BibTeX RDF
13	Hans L. Bodlaender, Fedor V. Fomin	Tree Decompositions with Small Cost.	SWAT	2002	DBLP DOI BibTeX RDF
13	John H. Reif	Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix.	Algorithmica	2001	DBLP DOI BibTeX RDF	Nested Dissection, Parallel algorithms, Characteristic polynomial, Sparse linear systems
13	Pramod G. Joisha, Abhay Kanhere, Prithviraj Banerjee, U. Nagaraj Shenoy, Alok N. Choudhary	Handling context-sensitive syntactic issues in the design of a front-end for a MATLAB compiler.	ACM SIGAPL APL Quote Quad	2001	DBLP DOI BibTeX RDF	colon expressions, command-form function invocations, control constructs, single quote character, syntax analysis for MATLAB, assignments, matrices
13	Thomas G. Dietterich, Xin Wang 0010	Support Vectors for Reinforcement Learning.	PKDD	2001	DBLP DOI BibTeX RDF
13	Maw-Shang Chang, Haiko Müller	On the Tree-Degree of Graphs.	WG	2001	DBLP DOI BibTeX RDF
13	Thomas G. Dietterich, Xin Wang 0010	Support Vectors for Reinforcement Learning.	ECML	2001	DBLP DOI BibTeX RDF
13	Florin Dobrian, Alex Pothen	The design of I/O-efficient sparse direct solvers.	SC	2001	DBLP DOI BibTeX RDF
13	David Harel, Yehuda Koren	On Clustering Using Random Walks.	FSTTCS	2001	DBLP DOI BibTeX RDF
13	Edleno Silva de Moura, Gonzalo Navarro 0001, Nivio Ziviani, Ricardo A. Baeza-Yates	Fast and flexible word searching on compressed text.	ACM Trans. Inf. Syst.	2000	DBLP DOI BibTeX RDF	compressed pattern matching, natural language text compression, word searching, word-based Huffman coding
13	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-conquer approximation algorithms via spreading metrics.	J. ACM	2000	DBLP DOI BibTeX RDF	feedback set, spreading metrics, approximation algorithms, divide and conquer, multicut, linear arrangement
13	Vincent Bouchitté, Ioan Todinca	Approximating the Treewidth of AT-Free Graphs.	WG	2000	DBLP DOI BibTeX RDF
13	Haldun M. Özaktas	Connectivity Models for Optoelectronic Computing Systems.	IPDPS Workshops	2000	DBLP DOI BibTeX RDF
13	Anne Berry, Jean Paul Bordat, Pinar Heggernes	Recognizing Weakly Triangulated Graphs by Edge Separability.	SWAT	2000	DBLP DOI BibTeX RDF
13	Daniel L. Swets, Juyang Weng	Hierarchical Discriminant Analysis for Image Retrieval.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	hierarchical image database, complexity with large image databases, face recognition, Principal component analysis, object recognition, image retrieval, partitioning, discriminant analysis, tessellation
13	Xin He, Ming-Yang Kao, Hsueh-I Lu	A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs.	ESA	1999	DBLP DOI BibTeX RDF
13	David A. Hutchinson, Anil Maheshwari, Norbert Zeh	An External Memory Data Structure for Shortest Path Queries.	COCOON	1999	DBLP DOI BibTeX RDF
13	Ran Bachrach, Shai Fine, Eli Shamir 0001	Query by Committee, Linear Separation and Random Walks.	EuroCOLT	1999	DBLP DOI BibTeX RDF
13	Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller	A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.	WG	1998	DBLP DOI BibTeX RDF
13	Alon Efrat, Otfried Schwarzkopf	Separating and Shattering Long Line Segments.	ISAAC	1996	DBLP DOI BibTeX RDF	line-seperation, Computational Geometry, BSP-trees
13	Ton Kloks, Haiko Müller, C. K. Wong	Vertex Ranking of Asteroidal Triple-Free Graphs.	ISAAC	1996	DBLP DOI BibTeX RDF
13	Hristo N. Djidjev	On-Line Algorithms for Shortest Path Problems on Planar Digraphs.	WG	1996	DBLP DOI BibTeX RDF
13	John R. Gilbert, Gary L. Miller, Shang-Hua Teng	Geometric mesh partitioning: implementation and experiments.	IPPS	1995	DBLP DOI BibTeX RDF	geometric mesh partitioning, equal-sized pieces, geometric coordinates, mesh vertices, Matlab code, spectral bisection, computational geometry, mesh generation, finite element analysis, irregular mesh, finite element meshes
13	Bharat Kumar, P. Sadayappan, Chua-Huang Huang	On sparse matrix reordering for parallel factorization.	International Conference on Supercomputing	1994	DBLP DOI BibTeX RDF	matrix reordering, nested dissection, parallel sparse factorization, distributed memory machine, spectral partitioning