Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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\documentclass[12pt]{minimal… 
2013
2013
Lang's "universal molecule" algorithm solves a variant of the origami design problem. It takes as input a metric tree and a…