19320 search results - page 3558 / 3864 » On the complexity of computing determinants |
192
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
240
click to vote
ACNS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
188
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
194
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
233
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose a new bilateral filtering algorithm with computational
complexity invariant to filter kernel size, socalled
O(1) or constant time in the literature. By showing
that a...