Search results for "hypergraph"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Lawrence Leinweber, Swarup Bhunia	Fine-Grained Supply Gating Through Hypergraph Partitioning and Shannon Decomposition for Active Power Reduction.	DATE	2008	DBLP DOI BibTeX RDF
21	Samuel Rota Bulò, Andrea Albarelli, Andrea Torsello, Marcello Pelillo	A hypergraph-based approach to affine parameters estimation.	ICPR	2008	DBLP DOI BibTeX RDF
21	Gang Wu, Juanzi Li, Jianqiang Hu, Kehong Wang	System II: A Native RDF Repository Based on the Hypergraph Representation for RDF Data Model.	WAIM	2008	DBLP DOI BibTeX RDF
21	Henning Köhler	Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory.	FoIKS	2008	DBLP DOI BibTeX RDF
21	Markus Chimani, Carsten Gutwenger	Algorithms for the Hypergraph and the Minor Crossing Number Problems.	ISAAC	2007	DBLP DOI BibTeX RDF
21	Shao-Shin Hung, Damon Shing-Min Liu	Using Hypergraph-based Clustering Scheme for Traversal Prediction in Virtual Environments.	CIDM	2007	DBLP DOI BibTeX RDF
21	Byoung-Tak Zhang	Random Hypergraph Models of Learning and Memory in Biomolecular Networks: Shorter-Term Adaptability vs. Longer-Term Persistency.	FOCI	2007	DBLP DOI BibTeX RDF
21	Noga Alon, Asaf Shapira	On An Extremal Hypergraph Problem Of Brown, Erdös And Sós.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C65, 05D99
21	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
21	Hassan H. Malik, John R. Kender	Clustering web images using association rules, interestingness measures, and hypergraph partitions.	ICWE	2006	DBLP DOI BibTeX RDF	web image clustering, feature selection, association rules, web mining, hypergraphs, interestingness measures
21	Tamás Horváth 0001, Björn Bringmann, Luc De Raedt	Frequent Hypergraph Mining.	ILP	2006	DBLP DOI BibTeX RDF
21	Sriram Krishnamoorthy, Ümit V. Çatalyürek, Jarek Nieplocha, Atanas Rountev, P. Sadayappan	Data management and query - Hypergraph partitioning for automatic memory hierarchy management.	SC	2006	DBLP DOI BibTeX RDF
21	Michael Boyd, Peter McBrien	Comparing and Transforming Between Data Models Via an Intermediate Hypergraph Data Model.	J. Data Semantics	2005	DBLP DOI BibTeX RDF
21	Penny E. Haxell, Brendan Nagle, Vojtech Rödl	An Algorithmic Version of the Hypergraph Regularity Method.	FOCS	2005	DBLP DOI BibTeX RDF
21	Horst Bunke, Peter J. Dickinson, Miro Kraetzl	Theoretical and Algorithmic Framework for Hypergraph Matching.	ICIAP	2005	DBLP DOI BibTeX RDF
21	Iannis Tourlakis	Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
21	Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich	A New Algorithm for the Hypergraph Transversal Problem.	COCOON	2005	DBLP DOI BibTeX RDF
21	Koji Tsuda	Propagating distributions on a hypergraph by dual information regularization.	ICML	2005	DBLP DOI BibTeX RDF
21	Kang Li, Lusheng Wang 0001	An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring.	AAIM	2005	DBLP DOI BibTeX RDF
21	Nicola Galesi, Oliver Kullmann	Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
21	Wei Li 0002, Peter van Beek	Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition.	ICTAI	2004	DBLP DOI BibTeX RDF
21	Ingrid Fischer	Modeling Discontinuous Constituents with Hypergraph Grammars.	AGTIVE	2003	DBLP DOI BibTeX RDF
21	Jan Kratochvíl	Complexity of Hypergraph Coloring and Seidel's Switching.	WG	2003	DBLP DOI BibTeX RDF
21	Li Wei, Weining Qian, Aoying Zhou, Wen Jin, Jeffrey Xu Yu	HOT: Hypergraph-Based Outlier Test for Categorical Data.	PAKDD	2003	DBLP DOI BibTeX RDF
21	Subhash Khot	Hardness results for approximate hypergraph coloring.	STOC	2002	DBLP DOI BibTeX RDF
21	Roy Meshulam	The Clique Complex and Hypergraph Matching.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05D05, 05D15, 05E25
21	Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki	A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.	STACS	2001	DBLP DOI BibTeX RDF
21	Ümit V. Çatalyürek, Cevdet Aykanat	A hypergraph-partitioning approach for coarse-grain decomposition.	SC	2001	DBLP DOI BibTeX RDF
21	Alain Bretto, Hocine Cherifi	Noise Detection and Cleaning by Hypergraph Model.	ITCC	2000	DBLP DOI BibTeX RDF
21	Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni	Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms.	MFCS	1998	DBLP DOI BibTeX RDF
21	Chi-Jen Lu	Deterministic Hypergraph Coloring and Its Applications.	RANDOM	1998	DBLP DOI BibTeX RDF
21	Gautam Bhargava, Piyush Goel, Balakrishna R. Iyer	Hypergraph Based Reorderings of Outer Join Queries with Complex Predicates.	SIGMOD Conference	1995	DBLP DOI BibTeX RDF	SQL
21	Dimitris J. Kavvadias, Christos H. Papadimitriou, Martha Sideri	On Horn Envelopes and Hypergraph Transversals.	ISAAC	1993	DBLP DOI BibTeX RDF
21	Annegret Habel, Hans-Jörg Kreowski	Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement.	STACS	1987	DBLP DOI BibTeX RDF
19	Baris Sertkaya	Some Computational Problems Related to Pseudo-intents.	ICFCA	2009	DBLP DOI BibTeX RDF
19	Robert Berke, Mikael Onsjö	Propagation Connectivity of Random Hypergraphs.	SAGA	2009	DBLP DOI BibTeX RDF
19	David A. Cohen, Martin James Green, Chris Houghton	Constraint Representations and Structural Tractability.	CP	2009	DBLP DOI BibTeX RDF
19	Peng Ren 0001, Tatjana M. Aleksic, Richard C. Wilson 0001, Edwin R. Hancock	Hypergraphs, Characteristic Polynomials and the Ihara Zeta Function.	CAIP	2009	DBLP DOI BibTeX RDF
19	Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski 0001	An approximate Dirac-type theorem for k -uniform hypergraphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C65, 05C45, 05D05
19	Tamás Király, Lap Chi Lau, Mohit Singh	Degree Bounded Matroids and Submodular Flows.	IPCO	2008	DBLP DOI BibTeX RDF
19	Lijun Li, Carl Tropper	A Multiway Partitioning Algorithm for Parallel Gate Level Verilog Simulation.	ICPP	2008	DBLP DOI BibTeX RDF
19	Eden Chlamtac, Gyanit Singh	Improved Approximation Guarantees through Higher Levels of SDP Hierarchies.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
19	Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan	Unconditionally Reliable Message Transmission in Directed Hypergraphs.	CANS	2008	DBLP DOI BibTeX RDF	Unbounded Computing Power, Unconditional Reliability
19	Beate Krause, Robert Jäschke, Andreas Hotho, Gerd Stumme	Logsonomy - social information retrieval with logdata.	Hypertext	2008	DBLP DOI BibTeX RDF	logsonomy, search engine, folksonomy, query log analysis
19	Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky	Online Conflict-Free Colorings for Hypergraphs.	ICALP	2007	DBLP DOI BibTeX RDF
19	Lijun Li, Carl Tropper	A Design-Driven Partitioning Algorithm for Distributed Verilog Simulation.	PADS	2007	DBLP DOI BibTeX RDF
19	Michael Behrisch 0002, Amin Coja-Oghlan, Mihyun Kang	Local Limit Theorems for the Giant Component of Random Hypergraphs.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
19	Kamer Kaya, Cevdet Aykanat	Iterative-Improvement-Based Heuristics for Adaptive Scheduling of Tasks Sharing Files on Heterogeneous Master-Slave Environments.	IEEE Trans. Parallel Distributed Syst.	2006	DBLP DOI BibTeX RDF	file-sharing tasks, heterogeneous master-slave platform, Scheduling, grid computing, iterative improvement
19	Wai Yin Mok, David W. Embley	Generating Compact Redundancy-Free XML Documents from Conceptual-Model Hypergraphs.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	XML data redundancy, compact XML storage structures, XML scheme generation
19	Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige	Minimum Transversals in Posi-modular Systems.	ESA	2006	DBLP DOI BibTeX RDF
19	Magnus Bordewich, Martin E. Dyer, Marek Karpinski	Stopping Times, Metrics and Approximate Counting.	ICALP (1)	2006	DBLP DOI BibTeX RDF
19	Georg Gottlob, Reinhard Pichler, Fang Wei 0001	Tractable database design through bounded treewidth.	PODS	2006	DBLP DOI BibTeX RDF	database design, normal forms, fixed-parameter tractability, tree decomposition, bounded treewidth
19	Gaurav Khanna 0002, Ümit V. Çatalyürek, Tahsin M. Kurç, P. Sadayappan, Joel H. Saltz	A Data Locality Aware Online Scheduling Approach for I/O-Intensive Jobs with File Sharing.	JSSPP	2006	DBLP DOI BibTeX RDF
19	Peter Keevash, Benny Sudakov	The Turán Number Of The Fano Plane.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C65, 05C35
19	Zdenek Dvorák 0001, Vít Jelínek	On the Complexity of the G-Reconstruction Problem.	ISAAC	2005	DBLP DOI BibTeX RDF
19	Satoru Endo, Toshiyuki Miyamoto, Sadatoshi Kumagai, Taku Fujii	On Simulation of BPEL4WS/UML Descriptions.	APSEC	2005	DBLP DOI BibTeX RDF
19	Detlef Plump	Confluence of Graph Transformation Revisited.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
19	Lars Grunske	Formalizing Architectural Refactorings as Graph Transformation Systems.	SNPD	2005	DBLP DOI BibTeX RDF
19	Jianping Li, Kang Li, Ken C. K. Law, Hao Zhao	On Packing and Coloring Hyperedges in a Cycle.	COCOON	2005	DBLP DOI BibTeX RDF
19	Eli Berger	KKM-A Topological Approach For Trees.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05B40
19	Antonio Bucciarelli, Benjamin Leperchey	Hypergraphs and Degrees of Parallelism: A Completeness Result.	FoSSaCS	2004	DBLP DOI BibTeX RDF
19	D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan	On Byzantine Agreement over (2, 3)-Uniform Hypergraphs.	DISC	2004	DBLP DOI BibTeX RDF
19	Vijay Durairaj, Priyank Kalla	Guiding CNF-SAT search via efficient constraint partitioning.	ICCAD	2004	DBLP DOI BibTeX RDF
19	Enrique Alba 0001, Gabriel Luque	Growth Curves and Takeover Time in Distributed Evolutionary Algorithms.	GECCO (1)	2004	DBLP DOI BibTeX RDF
19	Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani	Counting Connected Graphs and Hypergraphs via the Probabilistic Method.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
19	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan	Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections.	LATIN	2004	DBLP DOI BibTeX RDF
19	Mayur Thakur, Rahul Tripathi	Complexity of Linear Connectivity Problems in Directed Hypergraphs.	FSTTCS	2004	DBLP DOI BibTeX RDF
19	Ken Satoh, Takeaki Uno	Enumerating Maximal Frequent Sets Using Irredundant Dualization.	Discovery Science	2003	DBLP DOI BibTeX RDF
19	Cory J. Butz, S. K. Michael Wong, Dan Wu 0006	A New Inference Axiom for Probabilistic Conditional Independence.	AI	2003	DBLP DOI BibTeX RDF
19	Andrzej Szalas	On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems.	FCT	2003	DBLP DOI BibTeX RDF
19	Andreas Huck, Eberhard Triesch	Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C65, 05C70
19	Tao Jiang 0003, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West	The Chromatic Spectrum of Mixed Hypergraphs.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
19	Rafal Kielbik, Juan Manuel Moreno, Andrzej Napieralski, Grzegorz Jablonski, Tomasz Szymanski	High-Level Partitioning of Digital Systems Based on Dynamically Reconfigurable Devices.	FPL	2002	DBLP DOI BibTeX RDF
19	Dimitris Achlioptas, Cristopher Moore	On the 2-Colorability of Random Hypergraphs.	RANDOM	2002	DBLP DOI BibTeX RDF
19	Renate Klempien-Hinrichs	Hyperedge Substitution in Basic Atom-Replacement Languages.	ICGT	2002	DBLP DOI BibTeX RDF
19	Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss	Complexity Note on Mixed Hypergraphs.	MFCS	2001	DBLP DOI BibTeX RDF
19	Mark Minas, Oliver Köth	Generating Diagram Editors with DiaGen.	AGTIVE	1999	DBLP DOI BibTeX RDF
19	Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov	Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning.	ALENEX	1999	DBLP DOI BibTeX RDF
19	Tamal K. Dey, János Pach	Extremal Problems for Geometric Hypergraphs.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
19	Klaus Barthelmann	When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?	MFCS	1998	DBLP DOI BibTeX RDF
19	Xiaoyong Du 0001, Zhibin Liu, Naohiro Ishii	A New Factoring Algorithm for Magic Predicates.	ASIAN	1998	DBLP DOI BibTeX RDF	query optimization, deductive databases, factoring, magic sets
19	Tamal K. Dey, János Pach	Extremal Problems for Geometric Hypergraphs.	ISAAC	1996	DBLP DOI BibTeX RDF
19	Hui Chen, Alan M. Frieze	Coloring Bipartite Hypergraphs.	IPCO	1996	DBLP DOI BibTeX RDF
19	Airi Salminen, Jean Tague-Sutcliffe, Charles McClellan	From Text to Hypertext by Indexing.	ACM Trans. Inf. Syst.	1995	DBLP DOI BibTeX RDF	constrained grammars, test types, text entities, transient hypergraphs, hypertext, grammars, properties, structured text
19	Joost Engelfriet	A Greibach Normal Form for Context-free Graph Grammars.	ICALP	1992	DBLP DOI BibTeX RDF
19	Fillia Makedon, Spyros Tragoudas	Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems.	WG	1990	DBLP DOI BibTeX RDF
19	Andrew K. C. Wong, Si W. Lu, Marc Rioux	Recognition and Shape Synthesis of 3-D Objects Based on Attributed Hypergraphs.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	attributed hypergraphs, shape synthesis, graph monomorphism, Grinnell imaging system, computer vision, computer vision, graph theory, computerised pattern recognition, computerised pattern recognition, range data, 3D object recognition
19	Leila De Floriani, Bianca Falcidieno	A hierarchical boundary model for solid object representation.	ACM Trans. Graph.	1988	DBLP DOI BibTeX RDF
19	Annegret Habel, Hans-Jörg Kreowski	Pretty Patterns Produced by Hyperedge Replacement.	WG	1987	DBLP DOI BibTeX RDF
19	V. S. Lakshmanan 0001, N. Chandrasekharan, C. E. Veni Madhavan	Recognition and Top-Down Generation of beta-Acyclic Database Schemes.	FSTTCS	1984	DBLP DOI BibTeX RDF
19	Pierpaolo Degano, A. Lomanto, Franco Sirovich	On Finding the Optimal Access Path to Resolve a Relational Data Base Query.	MFCS	1980	DBLP DOI BibTeX RDF
19	Carlo Batini, Alessandro D'Atri	Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design.	WG	1980	DBLP DOI BibTeX RDF
16	Ali Cevahir, Cevdet Aykanat, Ata Turk, Berkant Barla Cambazoglu	Site-Based Partitioning and Repartitioning Techniques for Parallel PageRank Computation.	IEEE Trans. Parallel Distributed Syst.	2011	DBLP DOI BibTeX RDF	sparse matrix partitioning, repartitioning, parallelization, web search, PageRank, graph partitioning, hypergraph partitioning, sparse matrix-vector multiplication
16	Rui Wang, Yong Zhang 0051, Shijun Liu, Lei Wu 0002, Xiangxu Meng	A Dependency-Aware Hierarchical Service Model for SaaS and Cloud Services.	IEEE SCC	2011	DBLP DOI BibTeX RDF	hierarchical services, multi-tenancy application, dependency, hypergraph
16	Zhaoshui He, Andrzej Cichocki, Shengli Xie, Kyuwan Choi	Detecting the Number of Clusters in n-Way Probabilistic Clustering.	IEEE Trans. Pattern Anal. Mach. Intell.	2010	DBLP DOI BibTeX RDF	Multiway clustering, parallel factor analysis (PARAFAC), model order selection, multiway array, higher order tensor, supersymmetric tensors, affinity arrays, enumeration of clusters, estimation of PARAFAC components, principal components enumeration, hypergraph, probabilistic clustering
16	Vince Bárány, Georg Gottlob, Martin Otto 0001	Querying the Guarded Fragment.	LICS	2010	DBLP DOI BibTeX RDF	hypergraph covers, conjunctive queries, descriptive complexity, finite model theory, guarded fragment
16	Jackey Z. Yan, Chris Chu, Wai-Kei Mak	SafeChoice: a novel clustering algorithm for wirelength-driven placement.	ISPD	2010	DBLP DOI BibTeX RDF	vlsi placement, physical design, hypergraph clustering
16	Lenwood S. Heath, Allan A. Sioson	Multimodal Networks: Structure and Operations.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	Multimodal network, biot, graph, hypergraph, mode, biological networks
16	Lenwood S. Heath, Allan A. Sioson	Semantics of Multimodal Network Models.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	Multimodal network, biot, graph, hypergraph, denotational semantics, mode, biological networks, biological model
16	Virginia N. L. Franqueira, Raul H. C. Lopes, Pascal van Eck	Multi-step attack modelling and simulation (MsAMS) framework based on mobile ambients.	SAC	2009	DBLP DOI BibTeX RDF	hypergraph, attack graph, vulnerability assessment, network attack