积分充值
 首页
前端开发
AngularDartElectronFlutterHTML/CSSJavaScriptReactSvelteTypeScriptVue.js构建工具
后端开发
.NetC#C++C语言DenoffmpegGoIdrisJavaJuliaKotlinLeanMakefilenimNode.jsPascalPHPPythonRISC-VRubyRustSwiftUML其它语言区块链开发测试微服务敏捷开发架构设计汇编语言
数据库
Apache DorisApache HBaseCassandraClickHouseFirebirdGreenplumMongoDBMySQLPieCloudDBPostgreSQLRedisSQLSQLiteTiDBVitess数据库中间件数据库工具数据库设计
系统运维
AndroidDevOpshttpdJenkinsLinuxPrometheusTraefikZabbix存储网络与安全
云计算&大数据
Apache APISIXApache FlinkApache KarafApache KyuubiApache OzonedaprDockerHadoopHarborIstioKubernetesOpenShiftPandasrancherRocketMQServerlessService MeshVirtualBoxVMWare云原生CNCF机器学习边缘计算
综合其他
BlenderGIMPKiCadKritaWeblate产品与服务人工智能亿图数据可视化版本控制笔试面试
文库资料
前端
AngularAnt DesignBabelBootstrapChart.jsCSS3EchartsElectronHighchartsHTML/CSSHTML5JavaScriptJerryScriptJestReactSassTypeScriptVue前端工具小程序
后端
.NETApacheC/C++C#CMakeCrystalDartDenoDjangoDubboErlangFastifyFlaskGinGoGoFrameGuzzleIrisJavaJuliaLispLLVMLuaMatplotlibMicronautnimNode.jsPerlPHPPythonQtRPCRubyRustR语言ScalaShellVlangwasmYewZephirZig算法
移动端
AndroidAPP工具FlutterFramework7HarmonyHippyIoniciOSkotlinNativeObject-CPWAReactSwiftuni-appWeex
数据库
ApacheArangoDBCassandraClickHouseCouchDBCrateDBDB2DocumentDBDorisDragonflyDBEdgeDBetcdFirebirdGaussDBGraphGreenPlumHStreamDBHugeGraphimmudbIndexedDBInfluxDBIoTDBKey-ValueKitDBLevelDBM3DBMatrixOneMilvusMongoDBMySQLNavicatNebulaNewSQLNoSQLOceanBaseOpenTSDBOracleOrientDBPostgreSQLPrestoDBQuestDBRedisRocksDBSequoiaDBServerSkytableSQLSQLiteTiDBTiKVTimescaleDBYugabyteDB关系型数据库数据库数据库ORM数据库中间件数据库工具时序数据库
云计算&大数据
ActiveMQAerakiAgentAlluxioAntreaApacheApache APISIXAPISIXBFEBitBookKeeperChaosChoerodonCiliumCloudStackConsulDaprDataEaseDC/OSDockerDrillDruidElasticJobElasticSearchEnvoyErdaFlinkFluentGrafanaHadoopHarborHelmHudiInLongKafkaKnativeKongKubeCubeKubeEdgeKubeflowKubeOperatorKubernetesKubeSphereKubeVelaKumaKylinLibcloudLinkerdLonghornMeiliSearchMeshNacosNATSOKDOpenOpenEBSOpenKruiseOpenPitrixOpenSearchOpenStackOpenTracingOzonePaddlePaddlePolicyPulsarPyTorchRainbondRancherRediSearchScikit-learnServerlessShardingSphereShenYuSparkStormSupersetXuperChainZadig云原生CNCF人工智能区块链数据挖掘机器学习深度学习算法工程边缘计算
UI&美工&设计
BlenderKritaSketchUI设计
网络&系统&运维
AnsibleApacheAWKCeleryCephCI/CDCurveDevOpsGoCDHAProxyIstioJenkinsJumpServerLinuxMacNginxOpenRestyPrometheusServertraefikTrafficUnixWindowsZabbixZipkin安全防护系统内核网络运维监控
综合其它
文章资讯
 上传文档  发布文章  登录账户
IT文库
  • 综合
  • 文档
  • 文章

无数据

分类

全部后端开发(513)C++(178)数据库(135)Julia(76)Python(74)云计算&大数据(64)数据库工具(58)综合其他(51)其它语言(44)PostgreSQL(40)

语言

全部英语(793)

格式

全部PDF文档 PDF(698)其他文档 其他(90)PPT文档 PPT(5)
 
本次搜索耗时 0.130 秒,为您找到相关结果约 793 个.
  • 全部
  • 后端开发
  • C++
  • 数据库
  • Julia
  • Python
  • 云计算&大数据
  • 数据库工具
  • 综合其他
  • 其它语言
  • PostgreSQL
  • 全部
  • 英语
  • 全部
  • PDF文档 PDF
  • 其他文档 其他
  • PPT文档 PPT
  • 默认排序
  • 最新排序
  • 页数排序
  • 大小排序
  • 全部时间
  • 最近一天
  • 最近一周
  • 最近一个月
  • 最近三个月
  • 最近半年
  • 最近一年
  • pdf文档 Designing a Slimmer Vector of Variants

    L.P. All rights reserved.© 2024 Bloomberg Finance L.P. All rights reserved. Designing a Slimmer Vector of Variants CppCon 2024 September 18, 2024 Chris Fretz Senior C++ Engineer 2© 2024 Bloomberg details my experience in creating a novel solution to an observed problem with memory usage of std::vector> • The talk starts with the motivating use case, considers several candidate Heterogeneous containers like std::vector> are an extremely natural way to represent data across many different paradigms • Naive usage of std::vector> can result in
    0 码力 | 64 页 | 1.98 MB | 6 月前
    3
  • pdf文档 Back to Basics Almost Always Vector

    1#include #include #include <vector> int a[] = {0, 1, 2, 3, 4}; std::vector c = {0, 1, 2, 3, 4}; auto main() -> int { std::cout << "C style array: " << sizeof(a) / sizeof(a[0]) sizeof(a[0]) << std::endl; std::cout << "Vector size: " << c.size() << std::endl; return 0; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 https://www.reddit.com/r/cpp/comments/qm6i25/my_professor_is_telling _us_to_never_use_vectors/ 2more std::vector? 3How do you read a technical book front to back? As a technical editor... 4#include int main() { int cppconEarlyYears[6] = {2014, 2015, 2016
    0 码力 | 62 页 | 4.86 MB | 6 月前
    3
  • pdf文档 Lecture Notes on Support Vector Machine

    Lecture Notes on Support Vector Machine Feng Li fli@sdu.edu.cn Shandong University, China 1 Hyperplane and Margin In a n-dimensional space, a hyper plane is defined by ωT x + b = 0 (1) where ω ∈ Rn Rn is the outward pointing normal vector, and b is the bias term. The n-dimensional space is separated into two half-spaces H+ = {x ∈ Rn | ωT x + b ≥ 0} and H− = {x ∈ Rn | ωT x + b < 0} by the hyperplane margin is defined as γ = min i γ(i) (6) 1 ? ? ! ? ! Figure 1: Margin and hyperplane. 2 Support Vector Machine 2.1 Formulation The hyperplane actually serves as a decision boundary to differentiating
    0 码力 | 18 页 | 509.37 KB | 1 年前
    3
  • pdf文档 Lecture 6: Support Vector Machine

    Lecture 6: Support Vector Machine Feng Li Shandong University fli@sdu.edu.cn December 28, 2021 Feng Li (SDU) SVM December 28, 2021 1 / 82 Outline 1 SVM: A Primal Form 2 Convex Optimization Review Hyperplane Separates a n-dimensional space into two half-spaces Defined by an outward pointing normal vector ω ∈ Rn Assumption: The hyperplane passes through origin. If not, have a bias term b; we will then along ω (b < 0 means in opposite direction) Feng Li (SDU) SVM December 28, 2021 3 / 82 Support Vector Machine A hyperplane based linear classifier defined by ω and b Prediction rule: y = sign(ωTx +
    0 码力 | 82 页 | 773.97 KB | 1 年前
    3
  • pdf文档 Better Code: Contracts

    Reserved. zip_vector template 
 class zip_vector { vector _first;
 vector _second; public: const vector& first() const { return _first; }
 const vector& second() Reserved. zip_vector template 
 class zip_vector { vector _first;
 vector _second; public: const vector& first() const { return _first; }
 const vector& second() Reserved. zip_vector template 
 class zip_vector { vector _first;
 vector _second; public: const vector& first() const { return _first; }
 const vector& second()
    0 码力 | 204 页 | 4.46 MB | 6 月前
    3
  • pdf文档 Cache-Friendly Design in Robot Path Planning

    // std::map #include <vector> // std::vector class TerminateAtGoal { private: VertexID goal_; std::priority_queuevector, std::greater> // std::map #include <vector> // std::vector class TerminateAtGoal { private: VertexID goal_; std::priority_queuevector, std::greater> // std::map #include <vector> // std::vector 1 2 3 4 5 class TerminateAtGoal 6 { 7 private: 8 VertexID goal_; 9 10 std::priority_queuevector, std::greater>
    0 码力 | 216 页 | 10.68 MB | 6 月前
    3
  • pdf文档 Noexcept: Enabling Testing of Contract Checks

    2023 (CC BY 4.0) 9 int a, b; vector v; static_assert(noexcept(a + b)); // OK, int addition can't throw static_assert(noexcept(v.empty())); // OK, vector::empty can't throw static_assert(noexcept(v preconditions have been met • Example contract for vector::pop_back() : • Precondition: the vector is not empty • Postcondition: the last element of the vector has been removed 4-Oct-23 Pablo Halpern and Timur addition • Example: vector::size() • A function has a narrow contract if it has preconditions: • Example: signed integer addition (precondition: a + b will not over/underflow) • Example: vector::front() (precondition:
    0 码力 | 90 页 | 1.38 MB | 6 月前
    3
  • pdf文档 Thinking Functionally In C++

    implementation std::vector GetBirthdayEmployeesThisWeek() { const auto allEmployees = GetCurrentEmployees(); const auto dateRange = GetThisWeekDateRange(); std::vector birthdayEmployees; implementation std::vector GetBirthdayEmployeesThisWeek() { const auto allEmployees = GetCurrentEmployees(); const auto dateRange = GetThisWeekDateRange(); std::vector birthdayEmployees; implementation std::vector GetBirthdayEmployeesThisWeek() { const auto allEmployees = GetCurrentEmployees(); const auto dateRange = GetThisWeekDateRange(); std::vector birthdayEmployees;
    0 码力 | 114 页 | 3.14 MB | 6 月前
    3
  • pdf文档 Julia 1.10.0 DEV Documentation

    . . . . . . . . . . . . . . . . . . . . 434 34.18 Consider StaticArrays.jl for small fixed-size vector/matrix operations . . . . . . . . . 435 34.19 Avoid string interpolation for I/O . . . . . . . . . . . . . . . . . . . . . 1454 93.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1455 93.3 Sparse Vector and Matrix Constructors . . . . . . . . . . . . julia> a = [1,2,3] # an array of 3 integers 3-element Vector{Int64}: 1 2 3 julia> b = a # both b and a are names for the same array! 3-element Vector{Int64}: 1 2 3 Here, the line b = a does not make
    0 码力 | 1678 页 | 5.95 MB | 1 年前
    3
  • pdf文档 Julia v1.9.4 Documentation

    . . . . . . . . . . . . . . . . . . . . 431 34.18 Consider StaticArrays.jl for small fixed-size vector/matrix operations . . . . . . . . . 432 34.19 Avoid string interpolation for I/O . . . . . . . . . . . . . . . . . . . . . 1424 92.2 Sparse Vector Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1425 92.3 Sparse Vector and Matrix Constructors . . . . . . . . . . . . julia> a = [1,2,3] # an array of 3 integers 3-element Vector{Int64}: 1 2 3 julia> b = a # both b and a are names for the same array! 3-element Vector{Int64}: 1 2 3 Here, the line b = a does not make
    0 码力 | 1644 页 | 5.27 MB | 1 年前
    3
共 793 条
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 80
前往
页
相关搜索词
DesigningSlimmerVectorofVariantsBacktoBasicsAlmostAlwaysLectureNotesonSupportMachineBetterCodeContractsCacheFriendlyDesigninRobotPathPlanningNoexceptEnablingTestingContractChecksThinkingFunctionallyInC++Julia1.10DEVDocumentationv19.4
IT文库
关于我们 文库协议 联系我们 意见反馈 免责声明
本站文档数据由用户上传或本站整理自互联网,不以营利为目的,供所有人免费下载和学习使用。如侵犯您的权益,请联系我们进行删除。
IT文库 ©1024 - 2025 | 站点地图
Powered By MOREDOC AI v3.3.0-beta.70
  • 关注我们的公众号【刻舟求荐】,给您不一样的精彩
    关注我们的公众号【刻舟求荐】,给您不一样的精彩