2570 search results - page 259 / 514 » Fast Algorithms For The Computation Of Ranklets |
175
click to vote
GRAPHICSINTERFACE
2004
15 years 5 months ago
2004
In this paper, a novel hybrid algorithm is presented for the fast construction and high-quality rendering of visual hulls. We combine the strengths of two complementary hardware-a...
133
click to vote
IPM
2008
15 years 3 months ago
2008
A fast and efficient page ranking mechanism for web crawling and retrieval remains as a challenging issue. Recently, several link based ranking algorithms like PageRank, HITS and ...
122
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
132
click to vote
CSL
2005
Springer
15 years 9 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
151
Voted
PACT
2009
Springer
15 years 10 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...