1709 search results - page 24 / 342 » Comparing the Performance of Database Selection Algorithms |
193
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
219
click to vote
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
137
click to vote
ICIDS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Computational storytelling systems have mainly focused on the construction and evaluation of textual discourse for communicating stories. Few intelligent camera systems h...
140
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
139
click to vote
AAAI
2012
13 years 4 months ago
2012
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...