3206 search results - page 154 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
117
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the...
129
Voted
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
137
click to vote
PAMI
2010
15 years 1 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
109
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Object tracking based on Mean Shift (MS) algorithm has been very successful and thus receives significant research interests. Unfortunately, traditional MS based tracking only ut...
144
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...