登录后查看消息通知
搜索
常见问题
消息
登录
首页
/
数据集
/
Number of triangular surfaces for each simplified model.
Number of triangular surfaces for each simplified model.
收藏
NIAID Data Ecosystem
2026-05-02 收录
三维模型简化
复杂度分析
数据链接:
https://figshare.com/articles/dataset/Number_of_triangular_surfaces_for_each_simplified_model_/29419665
数据链接
链接失效反馈
官方服务:
问题咨询
购买咨询
在线客服
NEW
资源简介:
Number of triangular surfaces for each simplified model.
应用场景:
创建时间:
2025-06-26
相关数据集
stefanocarrera/autophagycode_D_he_train-mercury_Qwen3-4B_strategy_scm_t0.2_g10_metrics
代码质量评估
复杂度分析
--- dataset_info: features: - name: task_id dtype: string - name: entry_point dtype: string - name: is_executable dtype: bool - name: is_correct dtype: bool - name: tests_p
Hugging Face
2026-04-25 更新
11
0
Appendix C. Summary of the hierarchical linear models of fish abundance as a function of image complexity variables.
鱼类生态监测
复杂度分析
Summary of the hierarchical linear models of fish abundance as a function of image complexity variables.
Figshare
2016-08-04 更新
5
0
Comparison of network embedding methods in terms of complexity in time.
网络嵌入
复杂度分析
Comparison of network embedding methods in terms of complexity in time.
NIAID Data Ecosystem
4
0
File S1 - GASOLINE: a Greedy And Stochastic algorithm for Optimal Local multiple alignment of Interaction NEtworks
生物网络对齐
复杂度分析
Contains supporting material on GASOLINE asymptotic complexity. (PDF)
NIAID Data Ecosystem
9
0
Comparison of time complexity (per iteration) and memory usage of our proposed S3CMTF and other CMTF algorithms.
张量分解算法
复杂度分析
S3CMTF-opt shows the lowest time complexity and S3CMTF-base shows the lowest memory usage. For simplicity, we assume that all modes are of size I, of rank J, and an I × K matrix is coupled to one mode
Figshare
2019-06-28 更新
5
0
© 2023-2026 上海数据发展科技有限责任公司 版权所有
沪ICP备17003045号-15
沪公网安备31010402336585号
热门搜索
社区交流群
科研交流群
商业服务
数据资源
寻源服务
数据采集
标注服务
数据产品
代理销售
数据领域
凭证登记
数据产品
介绍推广