Matching

Known as: Matched vertex, Complete matching, Maximum weight matching 
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1955-2018
050001000019552017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
In this paper, we present a large-scale object retrieval system. The user supplies a query object by selecting a region of a… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We describe an approach to object and scene retrieval which searches for and localizes all the occurrences of a user outlined… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper presents my work on computing shape models that are computationally fast and invariant basic transformations like… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
ÐThe need for efficient content-based image retrieval has increased tremendously in many application areas such as biomedicine… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
where fk is the current approximation, and Rk f the current residual (error). Using initial values of Ro f = f , fo = 0, and k… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The matching properties of the threshold voltage, substrate factor and current factor of MOS transistors have been analysed and… (More)
  • table 1
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1977
Highly Cited
1977
An algorithm is presented which finds all occurrences of one. given string within another, in running time proportional to the… (More)
  • table 3
Is this relevant?
Highly Cited
1975
Highly Cited
1975
This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of… (More)
  • figure 1
Is this relevant?
Highly Cited
1973
Highly Cited
1973
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?