Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Nissa Osheim"'
A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. Given a digraph G, a partially complemented digraph G ź is a digraph obtained from G by performing a sequence of vertex co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4570c2ec81dcf58438513be04a90c4c5
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642019692
ICCS (1)
ICCS (1)
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown that, for a graph model, performing a partitioning and then reordering w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0cf98793252e5332d1e38bc1d1e68290
https://doi.org/10.1007/978-3-642-01970-8_53
https://doi.org/10.1007/978-3-642-01970-8_53
Publikováno v:
Languages and Compilers for Parallel Computing ISBN: 9783540897392
LCPC
LCPC
Partial differential equation solvers spend most of their computation time performing nearest neighbor (stencil) computations on grids that model spatial domains. Tiling is an effective performance optimization for improving the data locality and ena
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96970c4adf04b887ccf652d2b1ff426e
https://doi.org/10.1007/978-3-540-89740-8_6
https://doi.org/10.1007/978-3-540-89740-8_6
Publikováno v:
Journal of Discrete Algorithms. (1):100-121
We address the problem of finding the locations of all instances of a string P in a text T, where preprocessing of T is allowed in order to facilitate the queries. Previous data structures for this problem include the suffix tree, the suffix array, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a076d42010e4f8a100d61c8d32726bd
