52 search results - page 2 / 11 » Algebraic fingerprints for faster algorithms |
171
click to vote
ASIACRYPT
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
152
click to vote
FOCS
2009
IEEE
16 years 16 days ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
180
Voted
ICMCS
2008
IEEE
16 years 7 days ago
2008
IEEE
An algorithm for extracting music fingerprints directly from an audio signal is proposed in this paper. The proposed music fingerprint aims to encapsulate various aspects of mus...
179
click to vote
ICAC
2006
IEEE
15 years 12 months ago
2006
IEEE
— As Internet worms become ever faster and more sophisticated, it is important to be able to extract worm signatures in an accurate and timely manner. In this paper, we apply mac...
268
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...