909 search results - page 102 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
190
click to vote
ICDE
2012
IEEE
13 years 3 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
207
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
113
click to vote
PDP
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents QLSE (QoS-constrained List Scheduling hEuristics), a Quality of Service-based launch time scheduling algorithm for wide area Grids. QLSE considers applications...
100
click to vote
KIVS
2005
Springer
15 years 7 months ago
2005
Springer
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...