Sciweavers

108 search results - page 10 / 22
» Privacy-Preserving Distributed Set Intersection
Sort
View
COMPGEOM
2006
ACM
14 years 21 days ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
HICSS
2005
IEEE
122views Biometrics» more  HICSS 2005»
14 years 10 days ago
Expressive and Efficient Peer-to-Peer Queries
It is demonstrated how to provide a peer-to-peer system that supports an expressive query language while maintaining efficient distribution over a wide-area network. The key is to...
Dennis Heimbigner
FOCS
2010
IEEE
13 years 4 months ago
Learning Convex Concepts from Gaussian Distributions with PCA
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
Santosh Vempala
SPAA
1998
ACM
13 years 11 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
ROBOCOMM
2007
IEEE
14 years 1 months ago
Distributed adaptive sampling using bounded-errors
—This paper presents a communication/coordination/ processing architecture for distributed adaptive observation of a spatial field using a fleet of autonomous mobile sensors. O...
Kévin Huguenin, Maria-João Rendas