ECCC
2006
13 years 11 months ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
FLAIRS
2001
14 years 25 days ago
2001
This paperaddresses the problemof algorithm discovery, via evolutionarysearch, in the context of matrix multiplication. Thetraditional multiplicationalgorithm requiresO(n3) multip...
IPPS
1997
IEEE
1997
IEEE
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
14 years 3 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...
ESA
2004
Springer
14 years 4 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
FPGA
2005
ACM
14 years 5 months ago
2005
ACM
We introduce a 64-bit ANSI/IEEE Std 754-1985 floating point design of a hardware matrix multiplier optimized for FPGA implementations. A general block matrix multiplication algor...