Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Kim, Sung"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Network analysis for active and passive propagation models
In-Jae Kim
,
Brian P. Barthel
,
Yuyoung Park
,
Jordan R. Tait
,
Joseph L. Dobmeier
,
Sung Kim
,
Dooyoung Shin
Networks
63
(2), 2014, pp. 160-169
Identifying quantitative trait loci via group-sparse multitask regression and feature selection: An imaging genetics study of the ADNI cohort
Hua Wang
,
Feiping Nie
,
Heng Huang
,
Sungeun Kim
,
Kwangsik Nho
,
Shannon L. Risacher
,
Andrew J. Saykin
,
Li Shen
Bioinformatics
28
(2), 2012, pp. 229-237
From phenotype to genotype: An association study of longitudinal phenotypic markers to Alzheimer's disease relevant SNPs
Hua Wang
,
Feiping Nie
,
Heng Huang
,
Jingwen Yan
,
Sungeun Kim
,
Kwangsik Nho
,
Shannon L. Risacher
,
Andrew J. Saykin
,
Li Shen
,
for the Alzheimer's Disease Neuroimaging Initiative
Bioinformatics
28
(18), 2012, pp. 619-625
Noise reduction in genome-wide perturbation screens using linear mixed-effect models
Danni Yu
,
John Danku
,
Ivan Baxter
,
Sungjin Kim
,
Olena K. Vatamaniuk
,
David E. Salt
,
Olga Vitek
Bioinformatics
27
(16), 2011, pp. 2173-2180
FTFD: An informatics pipeline supporting phylogenomic analysis of fungal transcription factors
Jongsun Park
,
Jaejin Park
,
Suwang Jang
,
Seryun Kim
,
Sunghyung Kong
,
Jaeyoung Choi
,
Kyohun Ahn
,
Juhyeon Kim
,
Seungmin Lee
,
Sunggon Kim
,
Bongsoo Park
,
Kyongyong Jung
,
Soonok Kim
,
Seogchan Kang
,
Yong-Hwan Lee
Bioinformatics
24
(7), 2008, pp. 1024-1025
Finding a longest nonnegative path in a constant degree tree
Sung Kwon Kim
Information Processing Letters
93
(6), 2005, pp. 275-279
A fast algorithm for the generalized
k
-keyword proximity problem given keyword offsets
Sung-Ryul Kim
,
Inbok Lee
,
Kunsoo Park
Information Processing Letters
91
(3), 2004, pp. 115-120
Maintaining mobile transactional consistency in hybrid broadcast environments
SungSuk Kim
,
Sun Ok Yang
,
SangKeun Lee
Acta Informatica
41
(2-3), 2004, pp. 65-81
Linear-time algorithm for finding a maximum-density segment of a sequence
Sung Kwon Kim
Information Processing Letters
86
(6), 2003, pp. 339-342
A simple reduction of non-uniformity in dynamic load balancing of quantized loads on hypercube multiprocessors and hiding balancing overheads
Hwakyung Rim
,
Ju-wook Jang
,
Sungchun Kim
Journal of Computer and System Sciences
67
(1), 2003, pp. 1-25
Computing the optimal bridge between two polygons
Sung Kwon Kim
,
Chan-Su Shin
Theory of Computing Systems
34
(4), 2001, pp. 337-352
Fully scalable fault-tolerant simulations for BSP and CGM
Sung-Ryul Kim
,
Kunsoo Park
Journal Parallel Distributed Computing
60
(12), 2000, pp. 1531-1560
A dynamic edit distance table
Sung-Ryul Kim
,
Kunsoo Park
Lecture Notes in Computer Science
1848
, 2000, pp. 60-68
Efficient list ranking algorithms on reconfigurable mesh
Sung-Ryul Kim
,
Kunsoo Park
Lecture Notes in Computer Science
1858
, 2000, pp. 262-271
Placing two disks in a convex polygon
Sung Kwon Kim
,
Chan-Su Shin
,
Tae-Cheon Yang
Information Processing Letters
73
(1-2), 2000, pp. 33-39
Efficient algorithms for two-center problems for a convex polygon
Sung Kwon Kim
,
Chan-Su Shin
Lecture Notes in Computer Science
1858
, 2000, pp. 299-309
Fully-scalable fault-tolerant simulations for BSP and CGM
Sung-Ryul Kim
,
Kunsoo Park
Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IPPS/SPDP'99 (San Juan, Puerto Rico, April 12-16, 1999)
, 1999, pp. 117-124
An efficient dynamic load balancing using the dimension exchange method for balancing of quantized loads on hypercube multiprocessors
Hwakyung Rim
,
Ju-wook Jang
,
Sungchun Kim
Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IPPS/SPDP'99 (San Juan, Puerto Rico, April 12-16, 1999)
, 1999, pp. 708-712
Computing weighted rectilinear median and center set in the presence of obstacles
Joonsoo Choi
,
Chan-Su Shin
,
Sung Kwon Kim
Lecture Notes in Computer Science
1533
, 1998, pp. 29-38
Constant-time RMESH algorithms for the range minima and co-minima problems
Sung Kwon Kim
Parallel Computing
24
(5-6), 1998, pp. 965-977
Algorithms for drawing binary trees in the plane
Chan-Su Shin
,
Sung Kwon Kim
,
Sung-Ho Kim
,
Kyung-Yong Chwa
Information Processing Letters
66
(3), 1998, pp. 133-139
Two-center problems for a convex polygon
Chan-Su Shin
,
Jung-Hyun Kim
,
Sung Kwon Kim
,
Kyung-Yong Chwa
Lecture Notes in Computer Science
1461
, 1998, pp. 199-210
Protein folding class predictor for SCOP: Approach based on global descriptors
Inna Dubchak
,
Ilya Muchnik
,
Sung-Hou Kim
Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology, ISMB'97 (Halkidiki, Greece, June 21-26, 1997)
, 1997, pp. 104-107
Logarithmic width, linear area upward drawing of AVL trees
Sung Kwon Kim
Information Processing Letters
63
(6), 1997, pp. 303-307
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees
Sung Kwon Kim
Proceedings of the 3rd International IEEE Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN'97 (Taipei, Taiwan, December 18-20, 1997)
, 1997, pp. 240-246
Seiten 1
2
>