Browse "School of Computing(전산학부)" by Title
Showing results 6861 to 6880 of 15971
| 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 |
| LR-based Parser의 효율적인 Syntax Error Repairing System의 개발에 관한연구 박경숙; 최광무; 전길남; 장천현, 한국정보과학회 1985년 가을 학술발표대회, pp.382 - 389, 한국정보과학회, 1985 |
| LR-based parsing 을 위한 효율적인 syntax error repair = Efficient syntax error repair for LR-based parserslink 박경숙; Park, Kyung-Sug; et al, 한국과학기술원, 1986 |
| LR-WPAN 기술 및 표준화 동향 김대영; 도윤미; 유성은; 장기수; 박우종; 서춘덕, 정보통신기술 논문지, v.18, no.2, pp.58 - 78, 2004-12 |
| LR에 근간을 둔 구문분석기에서 우문맥의 효율적인 계산의 확장 = An extention of an efficient computation of right context for LR-based parserslink 김철; Kim, Chul; et al, 한국과학기술원, 1995 |
| LR에 근간을 둔 구분분석기에서 우문맥의 효율적 계산 김철; 정민수; 이수현; 최광무, 한국정보과학회 1995년 봄 학술발표대회, pp.301 - 304, 한국정보과학회, 1994 |
| Lsomorphic strategy for processor allocation in k-ary n-cube systems Kang, MS; Yu, CS; Youn, HY; Lee, B; Kim, Myungchul, IEEE TRANSACTIONS ON COMPUTERS, v.52, no.5, pp.645 - 657, 2003-05 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,745 2020 - 2024
- 5,391 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989