FINE-GRAINED MONOLITH

被引：0
|
作者：
Louw, Michael
机构：
来源：
ARCHITECTURE SOUTH AFRICA | 2019年 / 96期
关键词：
D O I：
暂无
中图分类号：
TU [建筑科学];
学科分类号：
0813 ;
摘要：
引用
收藏
页码：48 / 49
页数：2
相关论文
共 50 条
  • [41] Fine-Grained Effect Sizes
    Ferron, John M.
    Kirby, Megan S.
    Lipien, Lodi
    SCHOOL PSYCHOLOGY, 2024,
  • [42] Fine-Grained Algorithms and Complexity
    Williams, Virginia Vassilevska
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [43] Fine-grained concurrent completion
    Kirchner, C
    Lynch, C
    Scharff, C
    REWRITING TECHNIQUES AND APPLICATIONS, 1996, 1103 : 3 - 17
  • [44] MINE THE FINE: FINE-GRAINED FRAGMENT DISCOVERY
    Kiapour, M. Hadi
    Di, Wei
    Jagadeesh, Vignesh
    Piramuthu, Robinson
    2015 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2015, : 3555 - 3559
  • [45] The Fine-Grained Complexity of CFL Reachability
    Koutris, Paraschos
    Deep, Shaleen
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (POPL):
  • [46] FINE-GRAINED AND LAYERED OBJECT RECOGNITION
    Wu, Yang
    Zheng, Nanning
    Liu, Yuanliu
    Yuan, Zejian
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2012, 26 (02)
  • [47] Fine-grained Program Partitioning for Security
    Huang, Zhen
    Jaeger, Trent
    Tan, Gang
    PROCEEDINGS OF THE 14TH EUROPEAN WORKSHOP ON SYSTEMS SECURITY (EUROSEC 2021), 2021, : 21 - 26
  • [48] Local Alignments for Fine-Grained Categorization
    Gavves, Efstratios
    Fernando, Basura
    Snoek, Cees G. M.
    Smeulders, Arnold W. M.
    Tuytelaars, Tinne
    INTERNATIONAL JOURNAL OF COMPUTER VISION, 2015, 111 (02) : 191 - 212
  • [49] Maximum Entropy Fine-Grained Classification
    Dubey, Abhimanyu
    Gupta, Otkrist
    Raskar, Ramesh
    Naik, Nikhil
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [50] Fine-grained Concurrency with Separation Logic
    Kapoor, Kalpesh
    Lodaya, Kamal
    Reddy, Uday S.
    JOURNAL OF PHILOSOPHICAL LOGIC, 2011, 40 (05) : 583 - 632
12345