Showing results 6941 to 6960 of 16140
Low-cost Control Flow Error Protection by Exploiting Available Redundancies in the Pipeline Rouf M.A.; Kim, Soontae, Asia and South Pacific Design Automation Conference, pp.175 - 180, ACM SIGDA, IEEE Circuits and Systems Society, 2012-01-31 |
Low-Cost Control Flow Protection via Available Redundancies in the Microprocessor Pipeline Rouf, Mohammad Abdur; Kim, Soon-Tae, IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, v.23, no.1, pp.131 - 141, 2015-01 |
Low-cost mechanisms for isolated cryptographic operations on commodity accelerators = 범용 가속기에서의 안전한 암호 연산을 위한 저비용 메커니즘 연구link Kim, Yonggon; 김용곤; et al, 한국과학기술원, 2016 |
Low-cost transient error protections for memory systems = 메모리 시스템을 위한 저비용의 일시적 오류 보호 기법들link Hong, Jeongkyu; 홍정규; et al, 한국과학기술원, 2017 |
Low-latency encoding strategy for highly reliable NAND flash memory = 고신뢰도 플래시 메모리를 위한 저지연 인코딩 기법 설계link Lee, Yongwook; Kim, Soontae; et al, 한국과학기술원, 2023 |
Low-power L1 instruction cache architecture based on horizontal indexing in embedded system = 임베디드 시스템에서 수평적인 인덱싱 기반 저전력 L1 Instruction cache 설계link Kang, Yeji; Kim, Soontae; et al, 한국과학기술원, 2018 |
Lower and Upper Bounds for Linkage Discovery Choi, SS; Jung, Kyomin; Moon, BR, IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, v.13, no.2, pp.201 - 216, 2009-04 |
LOWER BOUNDS FOR LOCAL MONOTONICITY RECONSTRUCTION FROM TRANSITIVE-CLOSURE SPANNERS Bhattacharyya, Arnab; Grigorescu, Elena; Jha, Madhav; Jung, Kyomin; Raskhodnikova, Sofya; Woodruff, David P., SIAM JOURNAL ON DISCRETE MATHEMATICS, v.26, no.2, pp.618 - 646, 2012 |
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners Bhattacharyya, Arnab; Grigorescu, Elena; Jha, Madhav; Jung, Kyomin; Raskhodnikova, Sofya; Woodruff, David P., 2011-08-12 |
Lower bounds for local monotonicity reconstruction from transitive-closure spanners Bhattacharyya, A; Grigorescu, E; Jha, M; Jung, Kyo-Min; Raskhodnikova, S; Woodruff, DP, LECTURE NOTES IN COMPUTER SCIENCE (INCLUDING SUBSERIES LECTURE NOTES IN ARTIFICIAL INTELLIGENCE AND LECTURE NOTES IN BIOINFORMATICS), v.6302, pp.448 - 461, 2010 |
Lower bounds for local monotonicity reconstruction from transitive-closure spanners Bhattacharyya Arnab; Grigorescu Elena; Jha Madhav; Jung, Kyomin; Raskhodnikova Sofya; Woodruff David P., 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010, pp.448 - 461, RANDOM, 2010-09-01 |
Lower bounds for pinning lines by balls Cheong, Otfried; Goaoc, Xavier; Holmsen, Andreas, European Conference on Combinatorics, Graph Theory and Applications, pp.567 - 571, 2009-09-11 |
Lower Bounds for Pinning Lines by Balls (Extended Abstract) Cheong, Otfried; Goaoc X.; Holmsen A., ELECTRONIC NOTES IN DISCRETE MATHEMATICS, v.34, pp.567 - 571, 2009-08 |
Lower bounds to Helly numbers of line transversals to disjoint congruent balls Cheong, Otfried; Goaoc, Xavier; Holmsen, Andreas, ISRAEL JOURNAL OF MATHEMATICS, v.190, no.1, pp.213 - 228, 2012-08 |
LPC 파라미터간 단어 인식능력에 관한 고찰 오영환, 대한전자공학회 추계 종합학술대회, 대한전자공학회, 1981 |
LR formalisms as abstract interpretations of grammar semantics O, S; Choe, Kwang-Moo, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E89D, no.12, pp.2924 - 2932, 2006-12 |
LR 구문 분석기에서의 우문맥을 사용한 효율적 국부적 최소 비용 삽입 스트링 계산 = An efficient computation of the locally least cost insertion string using right context in the LR parserlink 김익순; Kim, Ik-Soon; et al, 한국과학기술원, 1995 |
LR 파싱에서 축약 심볼에 대한 예상 이경옥; 최광무, 한국정보과학회 1998 봄 학술발표, pp.68 - 70, 한국정보과학회, 1998 |
LR(k) 구문분석기의 국부적 최적 축소 박우전; 이명준; 최광무, 정보과학회논문지(B), v.23, no.7, pp.743 - 751, 1996-07 |
LR(k)-colored grammar and its application = LR(k)-Colored 문법과 그 응용에 관한 연구link Lee, Myung-Joon; 이명준; et al, 한국과학기술원, 1991 |
Discover