18 search results - page 4 / 4 » cocoon 2010 |
175
click to vote
COCOON
2010
Springer
16 years 15 days ago
2010
Springer
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
173
Voted
COCOON
2010
Springer
16 years 15 days ago
2010
Springer
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
201
Voted
COCOON
2010
Springer
16 years 15 days ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...