1100 search results - page 89 / 220 » Approximate distance oracles |
EUROCRYPT
2004
Springer
15 years 1 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
119
click to vote
STOC
2012
ACM
13 years 15 days ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
DIALM
2003
ACM
15 years 3 months ago
2003
ACM
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
102
click to vote
CAD
2004
Springer
14 years 10 months ago
2004
Springer
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
166
click to vote
GIS
2007
ACM
15 years 11 months ago
2007
ACM
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...