瀏覽 的方式: 作者 D.T.Lee

跳到: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
或是輸入前幾個字:  
顯示 21 到 40 筆資料,總共 190 筆 < 上一頁   下一步 >
日期標題作者全文
1996Computational GeometryD.T.Lee-
2010Computational Geometry I & IID.T.Lee-
1999Computational Geometry I & IID.T.Lee-
十二月-1984Computational Geometry: A SurveyD.T.Lee; F.P.Preparata-
2005Computer Security in the 21st CenturyD.T.Lee; S.P.Shieh; J.D.Tygar-
六月-2000Computing and Combinatorics: ForewordJ.Tao; D.T.Lee-
1986Computing the Largest Empty RectangleB.Chazelle; R.L.Drysdale; D.T.Lee-
1985Computing the Relative Neighborhood Graph in the L1-metricD.T.Lee-
二月-2012Computing the Stretch Factor and Maximum Detour of Paths, Trees, and Cycles in the Normed SpaceC.Wulff-Nilsen; A.Gr�ne; R.Klein; E.Langetepe; D.T.Lee; T.-C.Lin; S.-H.Poon; T.-K.Yu-
四月-1986Computing the Visibility Polygon from an EdgeD.T.Lee; A.K.Lin-
八月-2011Connecting Two Trees with Optimal Routing CostKao, Mong-Jen; Katz, Bastian; Krug, Marcus; D.T.Lee; Noellenburg, Martin; Rutter, Ignaz-
三月-2011Constructing Optimal Shortcuts in Directed Weighted PathsR.Klein; M.Krug; E.Langetepe; D.T.Lee; D.Wagner-
六月-2000Content Management of Academia Sinica Digital LibraryJ.M.Ho; S.K.Huang; D.T.Lee-
六月-2000Content Management of Academia Sinica Digital LibraryJ.M.Ho; S.K.Huang; D.T.Lee-
四月-1999Critical area computation via Voronoi diagramsE.Papadopoulou; D.T.Lee-
六月-2005Crosstalk- and performance-driven multilevel full-chip routingT.Y.Ho; Y.W.Chang; S.J.Chen; D.T.Lee-
九月-2000DAViD: A Distributed Algorithm Visualization and Debugging System for Geometric ComputingL.H.Lin; D.T.Lee; K.Aoki-
八月-2011The Density Maximization Problem in GraphsKao, Mong-Jen; Katz, Bastian; Krug, Marcus; D.T.Lee; Rutter, Ignaz; Wagner, Dorothea-
六月-2006Design and Applications of an Algorithm Benchmark System in a Computational Problem SolvingM.Y.Chen; J.D.Wei; J.H.Huang; D.T.Lee-
二月-2003Design Parameters Study on the Stability and Perception of Riding Comfort of the Electrical Motorcycles under Rider LeaningH.C.Lai; J.S.Liu; L.S.Wang; D.T.Lee-