„Boolean Matching“

Suchergebnisse

17 Treffer

• Efficient Content-based Publish/Subscribe Routing and Boolean Expression Matching Algorithms
  Ji, Shuping ; Jacobsen, Hans-Arno ; Bakken, David E. 2018 Universitätsbibliothek der TU München
• Enumerating All Boolean Matches
  Nadel, Alexander ; Shalmon, Yogev 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding a Maximum Restricted t-Matching via Boolean Edge-CSP
  Iwamasa, Yuni ; Kobayashi, Yusuke ; Takazawa, Kenjiro 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Longest Common Extensions with Wildcards: Trade-Off and Applications
  Bathie, Gabriel ; Charalampopoulos, Panagiotis ; Starikovskaya, Tatiana 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Trade-Offs Between Entanglement and Communication
  Arunachalam, Srinivasan ; Girish, Uma 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Tight Lower Bounds for Problems Parameterized by Rank-Width
  Bergougnoux, Benjamin ; Korhonen, Tuukka ; Nederlof, Jesper 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algebraic Representations of Unique Bipartite Perfect Matching
  Beniamini, Gal 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Approximate Degree of Bipartite Perfect Matching
  Beniamini, Gal 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Noisy Boolean Hidden Matching with Applications
  Kapralov, Michael ; Musipatla, Amulya ; Tardos, Jakab ; Woodruff, David P. ; Zhou, Samson 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exponential Quantum Communication Reductions from Generalizations of the Boolean Hidden Matching Problem
  Doriguello, João F. ; Montanaro, Ashley 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Decision Tree Complexity of String Matching
  He, Xiaoyu ; Huang, Neng ; Sun, Xiaoming 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Online Elastic Degenerate String Matching
  Aoyama, Kotaro ; Nakashima, Yuto ; I, Tomohiro ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Boolean interpretation, matching, and ranking of natural language queries in product selection systems
  Moulton, Matthew ; Ng, Yiu-Kai
• Explicit matchings in the middle levels of the Boolean lattice
  Kierstead, H. A. ; Trotter, W. T.
• An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansion
  Zhang, Juling ; Yang, Guowu ; Hung, William N. N. ; Zhang, Yan ; Wu, Jinzhao
• An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansion
  Zhang, Juling ; Yang, Guowu ; Hung, William N. N. ; Zhang, Yan ; Wu, Jinzhao
• Biological Sequence Matching – Using Boolean Algebra and Fuzzy Logic: A Comparative Analysis
  Gill, Nivit ; Singh, Shailendra 2012 LAP LAMBERT Academic Publishing