155 search results - page 29 / 31 » A parallel, distributed algorithm for relational frequent pa... |
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we present the design and implementation of Ovid, a browser for Grid-related information. The key goal of Ovid is to support the seamless navigation of users in the...
ICS
2009
Tsinghua U.
13 years 10 months ago
2009
Tsinghua U.
Modern GPUs offer much computing power at a very modest cost. Even though CUDA and other related recent developments are accelerating the use of GPUs for general purpose applicati...
CIKM
2009
Springer
13 years 10 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
ALMOB
2007
13 years 5 months ago
2007
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...