10608 search results - page 521 / 2122 » Complexity of O'Hara's Algorithm |
168
click to vote
VLSISP
2010
15 years 4 months ago
2010
A Split decoding algorithm is proposed which divides each row of the parity check matrix into two or multiple nearly-independent simplified partitions. The proposed method signific...
188
click to vote
SIAMMAX
2010
15 years 27 days ago
2010
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
175
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
159
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
244
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...