155 search results - page 17 / 31 » A parallel, distributed algorithm for relational frequent pa... |
MLDM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The ability to discover the topic of a large set of text documents using relevant keyphrases is usually regarded as a very tedious task if done by hand. Automatic keyphra...
CCGRID
2006
IEEE
13 years 11 months ago
2006
IEEE
P2P systems represent a large portion of the Internet traffic which makes the data discovery of great importance to the user and the broad Internet community. Hence, the power of ...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
HPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
Modern scientific experiments can generate hundreds of gigabytes to terabytes or even petabytes of data that may furthermore be maintained in large numbers of relatively small fil...