3206 search results - page 97 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
117
Voted
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
210
Voted
VLDB
2002
ACM
16 years 2 months ago
2002
ACM
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
113
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
151
Voted
IEEEPACT
2009
IEEE
15 years 10 days ago
2009
IEEE
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...