1162 search results - page 112 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
CAV
2008
Springer
13 years 10 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
IPPS
2000
IEEE
14 years 18 days ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
PAMI
2010
13 years 3 months ago
2010
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
COMAD
2009
13 years 9 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
TELSYS
2008
13 years 8 months ago
2008
Increase in the network usage for more and more performance critical applications has caused a demand for tools that can monitor network health with minimum management traffic. Ada...