COCOON
2010
Springer
14 years 5 months 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...
COCOON
2010
Springer
14 years 5 months ago
2010
Springer
A universal cycle for the k-permutations of n = {1, 2, ..., n} is a circular string of length nk that contains each k-permutation exactly once as a substring. Jackson (Discrete Mat...
COCOON
2010
Springer
14 years 5 months 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...
COCOON
2010
Springer
14 years 5 months ago
2010
Springer
In identity-based public-key cryptography, an entity’s public key can be easily derived from its identity. The direct derivation of public keys in identity-based public-key crypt...
COCOON
2010
Springer
14 years 5 months ago
2010
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
COCOON
2010
Springer
14 years 5 months ago
2010
Springer
COCOON
2010
Springer
14 years 5 months ago
2010
Springer
COCOON
2010
Springer
14 years 5 months 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...