2938 search results - page 272 / 588 » On obfuscating point functions |
186
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
187
click to vote
INFOCOM
2006
IEEE
16 years 19 days ago
2006
IEEE
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...
159
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
214
click to vote
COCOON
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
166
click to vote
VISUALIZATION
1996
IEEE
15 years 10 months ago
1996
IEEE
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...