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

Kinetic tournament

A Kinetic Tournament is a kinetic data structure that functions as a priority queue for elements whose priorities change as a continuous function of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In this paper, we consider the problem of evaluating the continuous query of finding the $$k$$k nearest objects with respect to a… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Lang's "universal molecule" algorithm solves a variant of the origami design problem. It takes as input a metric tree and a… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
2009
2009
We study the problem of designing kinetic data structures (KDS’s for short) when event times cannot be computed exactly and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?