315 search results - page 55 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
139
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
141
click to vote
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
144
click to vote
TCOM
2008
15 years 3 months ago
2008
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
152
click to vote
MONET
2007
15 years 3 months ago
2007
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...
166
Voted
PODS
2012
ACM
13 years 6 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...