Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Wilhelm Pape

Known as: Pape, W. Pape 
Johann Georg Wilhelm Pape (3 January 1807 – 23 February 1854) was a German classical philologist and lexicographer. He is known today primarily as… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Smartphones enable a new, rich user experience in pervasive computing, but their hardware is still very limited in terms of… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Metric learning has been shown to significantly improve the accuracy of k-nearest neighbor (kNN) classification. In problems… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The commonly accepted interpretation is that a religious motive—the desire to please God—is the principal reason why people… Expand
  • table 1
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The ability to exert real-time, adaptive control of transportation processes is the core of many intelligent transportation… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
To bridge the gap between case studies and highly aggregate cross-country analyses of civil unrest, we use data from Uganda to… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • B. Walter
  • International Security
  • 1999
  • Corpus ID: 42245300
Why do some civil war negotiations succeed in ending conoict whereas others fail? Combatants in seventeen of the forty-one civil… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
nowledge management is an essential capability in the emerging knowledge economy. In particular, organizations have a valuable… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Abstract We describe a new shortest paths algorithm. Our algorithm achieves the same O(nm) worst-case time bound as Bellman-Ford… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Tih purp of this pape is to furter invesigae a Simp , yet meaningf, control problm to higkhl bue in robus coutolr desig and to… Expand
Is this relevant?
Highly Cited
1977
Highly Cited
1977
We investigate the inference rules that can be applied to functional and multivalued dependencies that exist in a database… Expand
Is this relevant?