2570 search results - page 138 / 514 » Fast Algorithms For The Computation Of Ranklets |
207
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
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...
120
click to vote
SPAA
1999
ACM
15 years 7 months ago
1999
ACM
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...
142
click to vote
GD
1995
Springer
15 years 7 months ago
1995
Springer
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...
91
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
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...
264
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...