„Graph Matching“

Suchergebnisse

1.007 Treffer

• Approximation and Online Algorithms – 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers
  2011 Springer Berlin Heidelberg
• Approximation and Online Algorithms – 7th International Workshop,WAOA 2009, Copenhagen Denmark, September 10-11, 2009. Revised Papers
  Jansen, Klaus ; Solis-Oba, Roberto 2010 Springer Berlin Heidelberg
• Graph based representations in pattern recognition – 6th IAPR TC 15 international workshop ; proceedings
  Escolano, Francisco 2007 Springer
• Partitioning Strategy Selection for In-Memory Graph Pattern Matching on Multiprocessor Systems
  Krause, Alexander ; Kissinger, Thomas ; Habich, Dirk ; Voigt, Hannes ; Lehner, Wolfgang 2023 Technische Universität Dresden
• DebEAQ - debugging empty-answer queries on large data graphs
  Lehner, Wolfgang ; Vasilyeva, Elena ; Heinze, Thomas ; Thiele, Maik 2023 Technische Universität Dresden
• Cardinality Estimation using Label Probability Propagation for Subgraph Matching in Property Graph Databases
  Wörteler, Leonard ; Renftle, Moritz ; Chondrogiannis, Theodoros ; Grossniklaus, Michael 2022 KOPS Universität Konstanz
• SynopSys – Large Graph Analytics in the SAP HANA Database Through Summarization
  Rudolf, Michael ; Paradies, Marcus ; Bornhövd, Christof ; Lehner, Wolfgang 2022 Technische Universität Dresden
• Order matters: Matching multiple knowledge graphs
  Hertling, Sven ; Paulheim, Heiko 2021 Universitätsbibliothek Mannheim
• On the Performance of Analytical and Pattern Matching Graph Queries in Neo4j and a Relational Database
  Hölsch, Jürgen ; Schmidt, Tobias ; Grossniklaus, Michael 2017 Bibliothek der Universität Konstanz
• Optimal Online Bipartite Matching in Degree-2 Graphs
  Bhangale, Amey ; Chakraborty, Arghya ; Harsha, Prahladh 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding d-Cuts in Claw-Free Graphs
  Ahn, Jungho ; Eagling-Vose, Tala ; Lucke, Felicia ; Paulusma, Daniel ; Smith, Siani 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Flipping Odd Matchings in Geometric and Combinatorial Settings
  Aichholzer, Oswin ; Brenner, Sofia ; Dorfer, Joseph ; Hoang, Phuc Hung ; Perz, Daniel ; Rieck, Christian ; Verciani, Francesco 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Robust and Efficient Camera-based Scene Reconstruction
  Resch, Benjamin Josef ; Lensch, Hendrik P. A. 2017 Universitätsbibliothek Tübingen
• Bulk-robust assignment problems: hardness, approximability and algorithms
  Bindewald, Viktor ; Michaels, Dennis ; Kaibel, Volker 2017 Universitätsbibliothek Dortmund
• Markov Chain Monte Carlo algorithms for the uniform sampling of combinatorial objects
  Rechner, Steffen 2018 Universitäts- und Landesbibliothek Sachsen-Anhalt
• Why-Query Support in Graph Databases
  Vasilyeva, Elena ; Lehner, Wolfgang ; Hose, Katja 2017 Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
• On graph algorithms for large-scale graphs
  Bury, Marc ; Bollig, Beate ; Sauerhoff, Martin 2015 Universitätsbibliothek Dortmund
• Graph-matching and FEM-based Registration of Computed Tomographies for Outcome Validation of Liver Interventions
  Oyarzun Laura, Cristina ; Sakas, Georgios ; Fellner, Dieter W. ; Bale, Reto 2016 Universitäts- und Landesbibliothek Darmstadt
• Discrete and Continuous Optimization Problems Arising in Medical Image Registration
  Stiglmayr, Michael 2010 Shaker
• Intensity matching through saliency maps for thermal and visible image registration for face detection applications
  Krishnan, Palani Thanaraj ; Balasubramanian, Parvathavarthini ; Jeyakumar, Vijay ; Mahadevan, Shriraam ; Raj, Alex Noel Joseph