315 search results - page 49 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
72
Voted
KDD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
118
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
72
Voted
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...
104
Voted
DEXA
2009
Springer
15 years 4 months ago
2009
Springer
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...