2570 search results - page 12 / 514 » Fast Algorithms For The Computation Of Ranklets |
104
click to vote
IPPS
1997
IEEE
1997
IEEE
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
15 years 1 months ago
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...
AMC
2008
14 years 10 months ago
2008
A detailed, comparative study of the numerical stability of the recursive algorithms, widely used to calculate the Zernike moments of an image, is presented in this paper. While m...
AICCSA
2006
IEEE
15 years 3 months ago
2006
IEEE
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
SEFM
2008
IEEE
15 years 4 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...