-
3361
Generalizing the Brady-Yong Algorithm: Efficient Fast Hough Transform for Arbitrary Image Sizes
Published 2025-01-01Get full text
Article -
3362
-
3363
-
3364
-
3365
-
3366
-
3367
MP-LLAVRec: an agricultural product recommendation algorithm based on LLAVA and user modal preference
Published 2025-01-01Get full text
Article -
3368
Comparative Analysis of Tillage Indices and Machine Learning Algorithms for Maize Residue Cover Prediction
Published 2024-12-01Get full text
Article -
3369
Research on formant estimation algorithm for high order optimal LPC root value screening
Published 2022-06-01Get full text
Article -
3370
-
3371
-
3372
-
3373
Research of the small Qubit quantum computing attack to the RSA public key cryptography
Published 2017-10-01Get full text
Article -
3374
-
3375
-
3376
-
3377
Application Assessment of OS-SART Reconstruction Algorithm with Limited Number of Projections in XCT Geometric Measurement
Published 2025-02-01“… In industrial X-ray Computed Tomography (XCT), two primary kinds of reconstruction algorithms are utilized: the Feldkamp-Davis-Kress (FDK) algorithm and the algebraic reconstruction technique (ART) algorithms. …”
Get full text
Article -
3378
Time-variant interest community based query message routing algorithm in opportunity social network
Published 2019-09-01“…To solve the problem that the successful rate of resource query is low in opportunity social network,a query message routing algorithm based on time-variant interest community was proposed.Two well-known mobile social datasets were firstly analyzed,and then the temporal and spatial correlations of users were found.The time-variant interest communities based on temporal and spatial correlations of users were constructed.Next,a dynamic query routing on the constructed time-variant interest communities was proposed.Theoretical analysis shows that the proposed routing can run in O (nlog n) time.The comparisons between the proposed routing and state-of-the-art message delivery algorithms show that the proposed routing can keep high query success rate,reduce the average query latency and the hop count of a query and maintain low system overhead.…”
Get full text
Article -
3379
Distributed nearneighbor search algorithm based on real-time traffic information in dynamic road network
Published 2014-12-01“…A novel distributed near neighbor search algorithm that makes use of real-time traffic information is presented.The geographic information are stored in the nearest smart camera using Voronoi partition,and cameras are located in the intersection.The intersection unimpeded degree is modeled and the time which vehicle travel between adjacent intersec-tions is estimated.When a vehicle search for some near neighbors,smart cameras set a delay to broadcast the near neighbor search packet based on the traffic parameters collected by smart camera networks.In this way,the near neighbor search packet can be transmitted according to current road conditions.Thus get the path to near targets quickly and effec-tively.Extensive experiments are londucted on real data sets,and the results show that proposed algorithm is efficient and scalable to large number of concurrent query,significantly outperforming state-of-the-art methods.…”
Get full text
Article -
3380
Recommendation Algorithm in Double-Layer Network Based on Vector Dynamic Evolution Clustering and Attention Mechanism
Published 2020-01-01“…Experiments on Movielens, CiaoDVD, and Filmtrust datasets verify the effectiveness of our proposed algorithm. Experimental results show that our proposed algorithm can attain a better performance than other state-of-the-art algorithms.…”
Get full text
Article