3206 search results - page 173 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
171
click to vote
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
108
click to vote
MICRO
2006
IEEE
15 years 9 months ago
2006
IEEE
VLIW and EDGE (Explicit Data Graph Execution) architectures rely on compilers to form high-quality hyperblocks for good performance. These compilers typically perform hyperblock f...
100
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
Optimized spaced seeds improve sensitivity and specificity in local homology search. Several authors have shown that multiple seeds can have better sensitivity and specificity t...
154
click to vote
SODA
1992
ACM
15 years 4 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
114
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
It is known that the proportionate normalized least mean square (PNLMS) algorithm outperforms traditional normalized least mean square(NLMS) algorithm, in terms of fast initial co...