1887 search results - page 230 / 378 » An efficient search algorithm for partially ordered sets |
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
CSL
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Extensive studies have shown that mining microarray data sets is important in bioinformatics research and biomedical applications. In this paper, we explore a novel type of genesa...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...