Sign Up to like & get
recommendations!
1
Published in 2019 at "Nature biotechnology"
DOI: 10.1038/s41587-018-0010-1
Abstract: Exponentially increasing amounts of unprocessed bacterial and viral genomic sequence data are stored in the global archives. The ability to query these data for sequence search terms would facilitate both basic research and applications such…
read more here.
Keywords:
search;
fast search;
viral genomic;
ultra fast ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2025 at "Scientific Reports"
DOI: 10.1038/s41598-025-01513-1
Abstract: To address the problem of relying on manual experience to determine the number of cluster centers, this paper introduces an approach for evaluating the performance degradation of rolling bearings using the clustering by fast search…
read more here.
Keywords:
bearing performance;
degradation;
fast search;
performance degradation ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2022 at "IEEE Transactions on Very Large Scale Integration (VLSI) Systems"
DOI: 10.1109/tvlsi.2022.3151402
Abstract: To date, only a tiny fraction of reconfigurable task placement algorithms is targeted at modern heterogeneous field-programmable gate array (FPGA) architecture, and they often focus on determining the final placement location and pursuing placement quality.…
read more here.
Keywords:
speed;
modern heterogeneous;
placement;
fast search ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2017 at "Mathematical Problems in Engineering"
DOI: 10.1155/2017/5060842
Abstract: Aiming at the mixed data composed of numerical and categorical attributes, a new unified dissimilarity metric is proposed, and based on that a new clustering algorithm is also proposed. The experiment result shows that this…
read more here.
Keywords:
search find;
find density;
fast search;
mixed data ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2025 at "Mathematics"
DOI: 10.3390/math13040574
Abstract: Spectral identification is an essential technology in various spectroscopic applications, often requiring large spectral databases. However, the reliance on large databases significantly increases computational complexity. To address this issue, we propose a novel fast search…
read more here.
Keywords:
using trees;
fine search;
search;
fast search ... See more keywords