exhibit
发表于 2025-3-26 23:24:44
,TASML: Two-Stage Adaptive Semi-supervised Meta-learning for Few-Shot Learning,y and efficiency, and interrelated hierarchies for integrated processing of visual inputs is a signature of human vision intelligence. Similar to the process of human recognition of unknown objects, meta-learning enables models to “learn to learn" by providing a small number of “support" samples to
极为愤怒
发表于 2025-3-27 01:50:17
http://reply.papertrans.cn/103/10217/1021664/1021664_32.png
Fillet,Filet
发表于 2025-3-27 06:28:51
http://reply.papertrans.cn/103/10217/1021664/1021664_33.png
博识
发表于 2025-3-27 13:27:49
,MHNA: Multi-Hop Neighbors Aware Index for Accelerating Subgraph Matching,the subgraph matching problem has been proven to be an NP-complete problem. While specific approaches aim to accelerate queries by leveraging favorable matching orders and pruning rules, they face limitations in handling large-scale graph data due to the exponential search space. Conversely, other m
骨
发表于 2025-3-27 15:39:57
,Epidemic Source Identification Based on Infection Graph Learning, enables tracing propagation processes and implementing effective measures to block transmission. However, most algorithms employed to identify propagation sources in networks heavily rely on prior knowledge of the underlying propagation models and associated parameters, as different propagation pat
情爱
发表于 2025-3-27 17:50:59
http://reply.papertrans.cn/103/10217/1021664/1021664_36.png
Conserve
发表于 2025-3-28 00:28:20
,Hierarchical Retrieval of Ancient Chinese Character Images Based on Region Saliency and Skeleton Mar image retrieval techniques when applied to ancient Chinese characters, this paper proposes a hierarchical retrieval method for ancient Chinese characters images based on region saliency and skeleton matching (RSSM). The proposed method utilizes saliency joint weighting algorithm to effectively int
四目在模仿
发表于 2025-3-28 03:54:21
,MHNA: Multi-Hop Neighbors Aware Index for Accelerating Subgraph Matching,the subgraph matching problem has been proven to be an NP-complete problem. While specific approaches aim to accelerate queries by leveraging favorable matching orders and pruning rules, they face limitations in handling large-scale graph data due to the exponential search space. Conversely, other m
规范要多
发表于 2025-3-28 06:31:22
http://reply.papertrans.cn/103/10217/1021664/1021664_39.png
amyloid
发表于 2025-3-28 12:15:08
,Locality Sensitive Hashing for Data Placement to Optimize Parallel Subgraph Query Evaluation, vertices, thereby reducing redundant communication and computation across multiple workers during parallel subgraph query evaluation. Extensive experimental studies conducted on both large real and synthetic graphs demonstrate that our proposed techniques lead to significant improvements in query performance compared to existing methods.