CONVERTING RUN CODE TO CHAIN CODE

被引:3
|
作者
BATCHELOR, BG
MARLOW, BK
机构
关键词
D O I
10.1080/01969728108927675
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:237 / 246
页数:10
相关论文
共 50 条
  • [41] A secure run of an untrusted program code in the PIVO system
    Varen zagon nepreverjene programske kode v sistemu PIVO
    1600, Electrotechnical Society of Slovenia (88): : 54 - 60
  • [42] Certifying compilation and run-time code generation
    Hornof, Luke
    Jim, Trevor
    Higher-Order and Symbolic Computation, 1999, 12 (04): : 337 - 375
  • [43] Harpy: Run-time Code Generation in Haskell
    Grabmueller, Martin
    Kleeblatt, Dirk
    HASKELL'07: PROCEEDINGS OF THE ACM SIGPLAN 2007 HASKELL WORKSHOP, 2007, : 94 - 94
  • [44] Reusing and Converting Code Clones to Aspects - An Algorithmic Approach
    Ajila, Samuel A.
    Gakhar, Angad S.
    Lung, Chung H.
    Zaman, Marzia
    2012 IEEE 13TH INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION (IRI), 2012, : 9 - 16
  • [45] DISTAN - SUBROUTINE FOR CONVERTING ZIP CODE DATA TO DISTANCES
    CHAPMAN, RG
    JOURNAL OF MARKETING RESEARCH, 1974, 11 (01) : 86 - 86
  • [46] DEVICE FOR CONVERTING PARALLEL GRAY CODE INTO A PULSE SEQUENCE
    GONCHAR, AI
    NESTERENKO, VS
    FAZKULLIN, VA
    VYRODOV, PV
    KRUGLOV, AS
    INSTRUMENTS AND EXPERIMENTAL TECHNIQUES, 1981, 24 (05) : 1200 - 1202
  • [47] Chain code histograms for rotation invariance
    Huerta-Hernandez, Carlos Eduardo
    Sanchez-Cruz, Hermilo
    2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI), VOL 1, 2014, : 190 - 193
  • [48] An efficient chain code with Huffman coding
    Liu, YK
    Zalik, B
    PATTERN RECOGNITION, 2005, 38 (04) : 553 - 557
  • [49] Chain Code Methods for Hexagonal Grids
    Wei X.
    Miao S.
    Pu G.
    Chen B.
    Cheng C.
    Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and Information Science of Wuhan University, 2019, 44 (11): : 1700 - 1707
  • [50] CYCLE CHAIN CODE PICTURE LANGUAGES
    BRANDENBURG, FJ
    CHYTIL, MP
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 532 : 157 - 173