Kenneth L. Clarkson

Kenneth Lee Clarkson is an American computer scientist known for his research in computational geometry. He is a researcher at the IBM Almaden… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2016
02419842016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
  • Lesibana Rafapa
  • 2014
Post-apartheid transnationalism in black South African literature: a reality or a fallacy? The quest of this paper is to probe… (More)
Is this relevant?
2013
2013
In this paper we investigate the convergence of the block Modified Accelerated Overrelaxation (MAOR) iterative method, when… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
The objective of this research work is to simplify and improve the efficiency of cursor control and its interactions on the… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2004
2004
VOLUME 2 | JULY 2004 | 525 More than 50 years after the first bacterial type IV secretion system (T4SS) — the conjugation… (More)
Is this relevant?
2003
2003
The placement of nucleosomes along genomic DNA is determined by signals that can be specific or degenerate at the level of… (More)
Is this relevant?
Review
2003
Review
2003
www.nature.com/reviews/micro The passage of Plasmodium parasites through liver cells stimulates the release of a host growth… (More)
Is this relevant?
2000
2000
Kenneth L. Clarkson Stanford University §1 I n t r o d u c t i o n We present algorithms for solving the geometric minimum… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
  • Marek Teichmanny
  • 2000
Given an object with n points on its boundary where ngers can be placed, we give algorithms to select a \strong" grasp with a… (More)
Is this relevant?
2000
2000
Given an object with n points on its boundary where ngers can be placed, we give algorithms to select a \strong" grasp with a… (More)
Is this relevant?
1984
1984
Kenneth L. Clarkson Stanford University §1 I n t r o d u c t i o n We present algorithms for solving the geometric minimum… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?