1709 search results - page 6 / 342 » Comparing the Performance of Database Selection Algorithms |
104
click to vote
BMCBI
2008
14 years 11 months ago
2008
Background: The recent availability of complete sequences for numerous closely related bacterial genomes opens up new challenges in comparative genomics. Several methods have been...
109
Voted
SIGMOD
2003
ACM
15 years 11 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
VIP
2003
15 years 29 days ago
2003
Using different algorithms to segment different images is a quite straightforward strategy for automated image segmentation. But the difficulty of the optimal algorithm selection ...
109
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
SISAP
2008
IEEE
15 years 6 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...