Search


Current filters:
Start a new search
Add filters:

Use filters to refine the search results.


Results 1-50 of 190 (Search time: 0.003 seconds).
Item hits:
DateTitleAuthor(s)File
12007Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online)Hsu, Chun-Nan; Lai, Jin-Mei; Liu, Chia-Hung; Tseng, Huei-Hun; Lin, Chih-Yun; Lin, Kuan-Ting; Yeh, Hsu-Hua; Sung, Ting-Yi; Hsu, Wen-Lian; Su, Li-Jen; Lee, Sheng-An; Chen, Chan-Han; Lee, Gen-Cher; D.T.Lee; Shiue, Yow-Ling; Yeh, Chang-Wei; Chang, Chao-Hui; Kao, Cheng-Yan; Chi-Ying, F.Huang-
2Jan-2003Knowledge Management for Computational Problem SolvingD.T.Lee; G.C.Lee; Y.W.Huang-
3Dec-2000A Faster One-Dimensional Topological Compaction AlgorithmH.F.S.Chen; D.T.Lee-
4Aug-1997The Smallest Pair of Non-crossing Paths in a Rectilinear PolygonC.D.Yang; D.T.Lee; C.K.Wong-
5Jun-1978The All Nearest Neighbor Problem for Convex PolygonsD.T.Lee; F.P.Preparata-
61985On Finding the Diameter of a Set of LinesY.T.Ching; D.T.Lee-
71980An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree ProblemJ.M.Smith; D.T.Lee; J.S.Liebman-
8Jan-1984On 2-Dimensional Channel Assignment ProblemD.T.Lee; J.Y.T.Leung-
9Mar-1986Computational Complexity of Art Gallery ProblemsD.T.Lee; A.K.Lin-
10Aug-1989A New Approach to Topological Via MinimizationM.Sarrafzadeh; D.T.Lee-
11Jan-1983(g0, g1,..., gk)-Trees and Unary 0L SystemsD.T.Lee; C.L.Liu; C.K.Wong-
121986Computing the Largest Empty RectangleB.Chazelle; R.L.Drysdale; D.T.Lee-
13Sep-1990Planar Subset of Multi-terminal NetsK.F.Liao; D.T.Lee; M.Sarrafzadeh-
14Jun-1981An On-Chip Compare/Steer Bubble SorterD.T.Lee; H.Chang; C.K.Wong-
151984On Maximum Empty Rectangle ProblemA.Naamad; W.L.Hsu; D.T.Lee-
16Feb-2009Fast Algorithms for the Density Finding ProblemD.T.Lee; T.C.Lin; H.I.Lu-
17Jul-1995Finding an Approximate Minimum-Link Visibility Path Inside a Simple PolygonM.H.Alsuwaiyel; D.T.Lee-
181990Parallel Geometric Algorithms on a Mesh Connected ComputerC.S.Jeong; D.T.Lee-
19Feb-1984On a Circle-Cover Minimization ProblemC.C.Lee; D.T.Lee-
20Sep-1980Quintary Trees: A File Structure for Multidimensional Database SystemsD.T.Lee; C.K.Wong-
21Dec-1990Minimum Cut for Circular-arc GraphsD.T.Lee; M.Sarrafzadeh; Y.F.Wu-
22Sep-1989On-Line Bin Packing in Linear TimeP.Ramanan; D.J.Brown; C.C.Lee; D.T.Lee-
23Jul-1982Medial Axis Transformation of a Planar ShapeD.T.Lee-
241977Worst Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad TreesD.T.Lee; C.K.Wong-
25Feb-1980Voronoi Diagrams in L1 (L∞) Metrics with 2-Dimensional Storage ApplicationsD.T.Lee; C.K.Wong-
26Oct-1980Two Dimensional Voronoi Diagrams in the Lp-metricD.T.Lee-
27Feb-1981Generalization of Voronoi Diagram in the PlaneD.T.Lee; R.L.Drysdale-
28Sep-1977Location of a Point in a Planar Subdivision and Its ApplicationsD.T.Lee; F.P.Preparata-
291981Record Allocation for Minimizing Expected Seek Delay TimeU.I.Gupta; D.T.Lee; J.Y.T.Leung; J.W.Pruitt; C.K.Wong-
30Apr-1983On Finding the Convex Hull of a Simple PolygonD.T.Lee-
31Nov-1979An Optimal Solution for the Channel-Assignment ProblemU.I.Gupta; D.T.Lee; J.Y.T.Leung-
321982Efficient Algorithms for Interval Graphs and Circular-arc GraphsU.I.Gupta; D.T.Lee; J.Y.T.Leung-
33Apr-1979A Note on the All Nearest Neighbor Problem for Convex PolygonsC.C.Yang; D.T.Lee-
34Feb-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-
35Feb-2000Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related ProblemsM.G.; rews; M.J.Atallah; D.Z.Chen; D.T.Lee-
36Mar-2007State of Charge Estimation for Electric Scooters by Using Learning MechanismsD.T.Lee; S.J.Shiah; C.M.Lee; Y.C.Wang-
37Oct-2000典藏數位化資訊環境之探討J.M.Ho; S.K.Huang; T.R.Chuang; D.T.Lee-
38Mar-2006SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment toolsShih, Arthur Chun-Chieh; D.T.Lee; Lin, Laurent; Peng, Chin-Lin; Chen, Shiang-Heng; Wu, Yu-Wei; Wong, Chun-Yi; Chou, Meng-Yuan; Shiao, Tze-Chang; Hsieh, Mu-Fen-
39Jun-2005Crosstalk- and performance-driven multilevel full-chip routingT.Y.Ho; Y.W.Chang; S.J.Chen; D.T.Lee-
40Feb-1998Two Guard Walkability of Simple PolygonsL.H.Tseng; D.T.Lee; P.Heffernan-
41May-1992An Optimal Algorithm for the Maximum Two-Chain ProblemR.D.Lou; M.Sarrafzadeh; D.T.Lee-
42Oct-2001The L∞ Voronoi Diagram of Segments and VLSI ApplicationsE.Papadopoulou; D.T.Lee-
43Mar-1996Computational GeometryD.T.Lee-
44Apr-1995Dot Pattern Matching in d-DimensionsP.J.deRezende; D.T.Lee-
451989Rectilinear Shortest Paths with Rectangular BarriersRezende, P.J.de; D.T.Lee; Y.F.Wu-
461981Finding Intersection of Rectangles by Range SearchD.T.Lee; C.K.Wong-
471986On a Circle Placement ProblemB.M.Chazelle; D.T.Lee-
48Sep-1983Dynamic Voronoi DiagramsI.G.Gowda; D.G.Kirkpatrick; D.T.Lee; A.Naamad-
491985Computing the Relative Neighborhood Graph in the L1-metricD.T.Lee-
50Jul-1981Number of Vias: A Control Parameter for Global Wiring of High Density ChipsD.T.Lee; S.J.Hong; C.K.Wong-
Results 1-50 of 190 (Search time: 0.003 seconds).