Efficient data structures for model-free data-driven computational mechanics (Q2237265): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cma.2021.113855 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: FLANN / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Eigen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3160498511 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2012.00357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-driven computational mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data driven computing with noisy material data sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-free data-driven inelasticity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-driven finite elasticity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-driven fracture mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-based derivation of material response / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-parametric material state field extraction from full field measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method for Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for Computing k-Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quad trees: A data structure for retrieval by composite keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfying general proximity/similarity queries with metric trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinements to nearest-neighbor searching in k-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Forests and Adaptive Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3327527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896033 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CMA.2021.113855 / rank
 
Normal rank

Latest revision as of 15:05, 17 December 2024

scientific article
Language Label Description Also known as
English
Efficient data structures for model-free data-driven computational mechanics
scientific article

    Statements

    Efficient data structures for model-free data-driven computational mechanics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2021
    0 references
    data-driven computing
    0 references
    solid mechanics
    0 references
    nearest neighbor problem
    0 references
    approximate nearest-neighbor search
    0 references
    data structures
    0 references
    data science
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references