A fuzzy service matching algorithm based on Bloom filter

No abstract is available for this paper.

• Publication year

  2012

• Venue

  2012 IEEE 14th International Conference on Communication Technology

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1109/icct.2012.6511334
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Using Parallel Bloom Filters for Multiattribute Representation on Network Services

  2010cited by this paper
• Quantitative Assessment Algorithm for the Dynamic Change of Data Set Based on Bloom Filter Distance

  2009cited by this paper
• Path sharing and predicate evaluation for high-performance XML filtering

  2003cited by this paper
• The many faces of publish/subscribe

  2003cited by this paper
• XPath queries on streaming data

  2003cited by this paper
• Filtering algorithms and implementation for very fast publish/subscribe systems

  2001cited by this paper
• Efficient filtering in publish-subscribe systems using binary decision diagrams

  2001cited by this paper
• Matching events in a content-based subscription system

  1999cited by this paper
• Efficient Recognition of Events in a Distributed System

  1995cited by this paper
• Space/time trade-offs in hash coding with allowable errors

  1970cited by this paper

• Soft computing-based methods for semantic service retrieval

  2017cites this paper