Sciweavers

6365 search results - page 240 / 1273
» Fast Local Computation Algorithms
Sort
View
ICCV
2009
IEEE
2171views Computer Vision» more  ICCV 2009»
16 years 10 months ago
Fast Visibility Restoration from a Single Color or Gray Level Image
One source of difficulties when processing outdoor images is the presence of haze, fog or smoke which fades the colors and reduces the contrast of the observed objects. We introdu...
Jean-Philippe Tarel and Nicolas Hautière
SPAA
1999
ACM
15 years 10 months ago
Recursive Array Layouts and Fast Parallel Matrix Multiplication
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
GD
1995
Springer
15 years 10 months ago
Fast Interactive 3-D Graph Visualization
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
Ingo Bruß, Arne Frick
IJCAI
2007
15 years 8 months ago
Kernel Conjugate Gradient for Fast Kernel Machines
We propose a novel variant of the conjugate gradient algorithm, Kernel Conjugate Gradient (KCG), designed to speed up learning for kernel machines with differentiable loss functio...
Nathan D. Ratliff, J. Andrew Bagnell
FOCS
2005
IEEE
16 years 3 days ago
Group-theoretic Algorithms for Matrix Multiplication
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...
Henry Cohn, Robert D. Kleinberg, Balázs Sze...