1403 search results - page 255 / 281 » Set cover algorithms for very large datasets |
DEXA
2006
Springer
14 years 4 days ago
2006
Springer
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
KDD
2000
ACM
14 years 1 days ago
2000
ACM
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
ICDT
1995
ACM
14 years 11 hour ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
COMAD
2008
13 years 10 months ago
2008
Huge amount of information is present in the World Wide Web and a large amount is being added to it frequently. A query-specific summary of multiple documents is very helpful to t...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...