139 search results - page 12 / 28 » Computing crossing numbers in quadratic time |
CIVR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We introduce a view–point invariant representation of moving object trajectories that can be used in video database applications. It is assumed that trajectories lie on...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
Particle filters encode a time-evolving probability density by maintaining a random sample from it. Level sets represent closed curves as zero crossings of functions of two variab...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...