Results 1 to 10 of about 31,140 (164)
GAT TransPruning: progressive channel pruning strategy combining graph attention network and transformer [PDF]
PeerJ Computer ScienceRecently, large-scale artificial intelligence models with billions of parameters have achieved good results in experiments, but their practical deployment on edge computing platforms is often subject to many constraints because of their resource ...
Yu-Chen Lin +2 more
doaj +3 more sources
Pruning Deep Convolutional Neural Networks Architectures with Evolution Strategy [PDF]
Information Sciences, 2021 Currently, Deep Convolutional Neural Networks (DCNNs) are used to solve all kinds of problems in the field of machine learning and artificial intelligence due to their learning and adaptation capabilities. However, most successful DCNN models have a high computational complexity making them difficult to deploy on mobile or embedded platforms.
Gary G Yen
exaly +3 more sources
An Accelerated MMP With a Pruning Tree Strategy [PDF]
IEEE Access, 2019 Multipath matching pursuit (MMP) has been developed to solve the sparse signal recovery problems in compressed sensing, which can generate recovery error less than the traditional orthogonal matching pursuit type algorithms in terms of mean square error.
Yuli Fu +4 more
doaj +2 more sources
Mechanical Pruning of ‘Clemenules’ Mandarins in Spain: Yield Effects and Economic Analysis
Agronomy, 2022 Pruning is one of the most expensive tasks in citrus production, and its mechanization could increase the productivity and competitiveness of citrus farms.
Alberto Fonte +4 more
doaj +1 more source
An Efficient Method for Mining Periodic Cliques [PDF]
Jisuanji gongcheng, 2023 Periodic cliques are complete subgraphs that meet specific periodic requirements when they appear on the temporal network.Periodic cliques mining is used to mine periodic cliques in the temporal graph.Considering the low efficiency of the existing ...
DU Ming, HAO Yan, ZHOU Junfeng, TAN Yuting
doaj +1 more source
Pre-indexing Pruning Strategies [PDF]
, 2020 We explore different techniques for pruning an inverted index in advance, that is, without building the full index. These techniques provide interesting trade-offs between index size, answer quality and query coverage. We experimentally analyze them in a large public web collection with two different query logs.
Soner Altin +2 more
openaire +2 more sources
Applied Sciences, 2023 Biomedical texts are relatively obscure in describing relations between specialized entities, and the automatic extraction of drug–drug or drug–disease relations from massive biomedical texts presents a challenge faced by many researchers.
Wanli Yang +4 more
doaj +1 more source
Incomplete Information Game Algorithm Based on Expectimax Search and Double DQN [PDF]
Jisuanji gongcheng, 2021 As a typical incomplete information game, mahjong is mainly realized by the traditional Expectimax search algorithm, whose pruning strategy and valuation function design based on artificial prior knowledge and thus cause unreasonable assumptions and ...
LEI Jiewei, WANG Jiayang, REN Hang, YAN Tianwei, HUANG Wei
doaj +1 more source
Frontiers in Plant Science, 2023 IntroductionInsect pests from the family Papilionidae (IPPs) are a seasonal threat to citrus orchards, causing damage to young leaves, affecting canopy formation and fruiting. Existing pest detection models used by orchard plant protection equipment lack
Lijia Xu +17 more
doaj +1 more source
A Method for Closed Frequent Subgraph Mining in a Single Large Graph
IEEE Access, 2021 Mining frequent subgraphs is an interesting and important problem in the graph mining field, in that mining frequent subgraphs from a single large graph has been strongly developed, and has recently attracted many researchers.
Lam B. Q. Nguyen +5 more
doaj +1 more source