1709 search results - page 174 / 342 » Comparing the Performance of Database Selection Algorithms |
174
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
183
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: The rapidly increasing number of completely sequenced genomes led to the establishment of the COG-database which, based on sequence homologies, assigns similar protein...
192
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
Keyword searches are attractive because they facilitate users searching structured databases. On the other hand, tag clouds are popular for navigation and visualization purposes o...
145
Voted
MICAI
2007
Springer
16 years 15 days ago
2007
Springer
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...
201
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
This paper proposes an algorithm called Imprecise Spectrum Analysis (ISA) to carry out fast dimension reduction for document classification. ISA is designed based on the one-sided...