Sciweavers

455 search results - page 25 / 91
» Dynamic well-spaced point sets
Sort
View
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 3 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
MOBICOM
2009
ACM
15 years 4 months ago
Dynamic spectrum access in DTV whitespaces: design rules, architecture and algorithms
In November 2008, the FCC ruled that the digital TV whitespaces be used for unlicensed access. This is an exciting development because DTV whitespaces are in the low frequency ran...
Supratim Deb, Vikram Srinivasan, Ritesh Maheshwari
SGP
2007
15 years 9 days ago
Dynamic geometry registration
We propose an algorithm that performs registration of large sets of unstructured point clouds of moving and deforming objects without computing correspondences. Given as input a s...
Niloy J. Mitra, Simon Flöry, Maks Ovsjanikov,...
ICASSP
2010
IEEE
14 years 10 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
15 years 10 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup