166 search results - page 8 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
103
click to vote
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to spee...
96
Voted
PAMI
2006
14 years 9 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
CAV
2004
Springer
15 years 2 months ago
2004
Springer
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary ...
84
Voted
IFL
1997
Springer
15 years 1 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
94
Voted
ICS
2007
Tsinghua U.
15 years 3 months ago
2007
Tsinghua U.
This paper presents Cooperative Cache Partitioning (CCP) to allocate cache resources among threads concurrently running on CMPs. Unlike cache partitioning schemes that use a singl...