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

Kinetic data structure

A kinetic data structure is a data structure used to track an attribute of a geometric system that is moving continuously.For example, a kinetic… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Even though organic management practices are intended to enhance soil performance by altering the quantity or quality of soil… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this article we analyzed and designed air flow controllers that protect the fuel cell (FC) stack from oxygen starvation during… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Topology has its roots in geometry and analysis. From a geometric point of view, topology was the study of properties preserved… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Abstract:We use electrocapillarity in order to change the contact angle of a transparent drop, thus realizing a lens of variable… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper we investigate the intricacies of an admirable water pumping device - the Zimbabwe Bush Pump `B' type - so as to… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • K. Jensen
  • Monographs in Theoretical Computer Science An…
  • 1997
  • Corpus ID: 39377973
Coloured Petri nets (CPN) is a formalism which extends ordinary Petri nets by adding data types and modularity. This means that… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Abstract This paper introduces a new image thresholding method based on minimizing the measures of fuzziness of an input image… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Hypertext users often suffer from the “lost in hyperspace” problem: disorientation from too many jumps while traversing a complex… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1976
Highly Cited
1976
The following result is shown. If T is a nonexpansive mapping from a closed convex subset D of a Banach space into a compact… Expand
Is this relevant?