Results 21 to 30 of about 31,239 (262)
Bonsai trees in your head: how the pavlovian system sculpts goal-directed choices by pruning decision trees. [PDF]
PLoS Computational Biology, 2012 When planning a series of actions, it is usually infeasible to consider all potential future sequences; instead, one must prune the decision tree. Provably optimal pruning is, however, still computationally ruinous and the specific approximations humans ...
Quentin J M Huys +5 more
doaj +1 more source
Connected operators based on region-tree pruning strategies [PDF]
Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2002 Peer ...
Salembier Clairon, Philippe Jean +1 more
openaire +2 more sources
IEEE Access, 2018 The A-star algorithm is an efficient classical algorithm for solving the shortest path problem. The efficiency of the algorithm depends on the evaluation function, which is used to estimate the heuristic value of the shortest path from the current vertex
Yan Li +5 more
doaj +1 more source
An Efficient Adjoint Pattern Mining Algorithm for Moving Object [PDF]
Jisuanji gongcheng, 2020 Mining adjoint patterns of moving objects is finding the set of objects with similar trajectories and time from a spatio-temporal perspective,which is widely used in user behavior analysis based on geographical location.However,the existing similarity ...
WANG Qitong, WANG Peng, ZHAO Yuliang, WANG Wei
doaj +1 more source
Efficient Compression of ResNet18 Model on CIFAR-10 Dataset [PDF]
ITM Web of ConferencesDeep neural networks excel in processing vision tasks, but their high computational complexity prevents them from being deployed directly on edge devices.
Zhao Ziteng
doaj +1 more source
Mining High-Efficiency Itemsets with Negative Utilities
MathematicsHigh-efficiency itemset mining has recently emerged as a new problem in itemset mining. An itemset is classified as a high-efficiency itemset if its utility-to-investment ratio meets or exceeds a specified efficiency threshold.
Irfan Yildirim
doaj +1 more source
Coarse-Grained Pruning of Neural Network Models Based on Blocky Sparse Structure
Entropy, 2021 Deep neural networks may achieve excellent performance in many research fields. However, many deep neural network models are over-parameterized. The computation of weight matrices often consumes a lot of time, which requires plenty of computing resources.
Lan Huang +5 more
doaj +1 more source
Pruning Strategies for Backdoor Defense in LLMs
Proceedings of the 34th ACM International Conference on Information and Knowledge ManagementBackdoor attacks are a significant threat to the performance and integrity of pre-trained language models. Although such models are routinely fine-tuned for downstream NLP tasks, recent work shows they remain vulnerable to backdoor attacks that survive vanilla fine-tuning. These attacks are difficult to defend because end users typically lack knowledge
Santosh Chapagain +2 more
openaire +2 more sources
Pruning Optimization over Threshold-Based Historical Continuous Query
Algorithms, 2019 With the increase in mobile location service applications, spatiotemporal queries over the trajectory data of moving objects have become a research hotspot, and continuous query is one of the key types of various spatiotemporal queries. In this paper, we
Jiwei Qin, Liangli Ma, Qing Liu
doaj +1 more source
Molecular Oncology, EarlyView.Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source