Jack Edmonds

Jack R. Edmonds (born April 5, 1934) is an American computer scientist, regarded as one of the most important contributors to the field of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
We present recursive recurrent neural networks with attention modeling (R2AM) for lexicon-free optical character recognition in… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2010
2010
König-Egerváry graphs are those whose maximum matchings are equicardinal to their minimumorder coverings by vertices. Edmonds [J… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Combinatorial optimization searches for an optimum object in a finite collection of objects. Typically, the collection has a… (More)
Is this relevant?
2005
2005
A strong stable set in a graph G is a stable set that contains a vertex of every maximal clique of G. A Meyniel obstruction is an… (More)
Is this relevant?
2003
2003
properties of linear independence. Beautiful paper. And various people had gone on studying the properties of these algebraic… (More)
  • figure 7
  • figure 8
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The use of feedback control theory for performance guarantees in QoS-aware systems has gained much attention in recent years. In… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Modern computer systems are expected to be up continuously: even planned downtime to accomplish system reconfiguration is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
2002
2002
We investigate the effect of fund size on performance among active mutual funds. We first document that fund returns, both before… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
“Jack Edmonds has been one of the creators of the field of combinatorial optimization and polyhedral combinatorics. His 1965… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
1973
1973
Let S be a set of linear inequalities that determine a bounded polyhedron P. The closure of S is the smallest set of inequalities… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?