15073 search results - page 277 / 3015 » Probabilistic algorithms for computing resultants |
128
click to vote
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
136
click to vote
TCOM
2010
15 years 2 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
348
click to vote
SIGCSE
2008
ACM
15 years 4 months ago
2008
ACM
Generating interest in specialized areas of Computer Science (CS) is one of the goals of the department of Computer and Information Science at Spelman College as with most departm...
133
Voted
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
142
click to vote
FOCS
1992
IEEE
15 years 8 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...