909 search results - page 97 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
114
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
138
click to vote
SODA
1992
ACM
15 years 2 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...
100
click to vote
SAMOS
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we present a new approach for generating high-speed optimized event-driven register transfer level (RTL) compiled simulators. The generation of the simulators is part...
147
click to vote
ALGOSENSORS
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
161
click to vote
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...