1100 search results - page 8 / 220 » Approximate distance oracles |
TIP
1998
13 years 8 months ago
1998
—The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desir...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
ASIACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
IWNAS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper proposes a simple and costeffective method named Transmission Error Approximation (TEA) for estimating the distance between two Zigbee devices. The idea is to measure a...