共 50 条
- [31] Computing and Mining ClustCube Cubes Efficiently ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PART II, 2015, 9078 : 146 - 161
- [32] Computing homotopic shortest paths efficiently ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 411 - 423
- [33] Design of Efficiently Encodable Rate-Compatible LDPC Codes Using Vandermonde Extension Matrices Wireless Personal Communications, 2011, 60 : 695 - 708
- [34] Efficiently computing the density of regular languages LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 262 - 270
- [35] Efficiently Computing Alignments Algorithm and Datastructures BUSINESS PROCESS MANAGEMENT WORKSHOPS, BPM 2018 INTERNATIONAL WORKSHOPS, 2019, 342 : 44 - 55
- [36] Computing homotopic shortest paths efficiently COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2006, 35 (03): : 162 - 172
- [37] Computing with Quasiseparable Matrices PROCEEDINGS OF THE 2016 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC 2016), 2016, : 389 - 396
- [38] EXPRESSING AND ANALYSING GOAL MODELS IN DESIGN STRUCTURE MATRICES INVEST ON VISUALIZATION, 2011, : 229 - 234