• Publications
  • Influence
A simple on-line bin-packing algorithm
The one-dimensional on-line bin-packing problem is considered, A simple <O</italic>(1)-space and <italic>O</ Italic>( 1)-time algorithm, called HARMONIC, is presented and is shown to have a worst-case performance ratio of less than 1.636. Expand
  • 352
  • 88
Robust visual domain adaptation with low-rank reconstruction
In this paper, we present a low-rank reconstruction method to reduce the domain distribution disparity. Expand
  • 267
  • 39
  • PDF
Computational complexity of art gallery problems
We study the computational complexity of the art gallery problem originally posed by Klee, and its variations. Expand
  • 401
  • 34
Two algorithms for constructing a Delaunay triangulation
  • D. Lee, B. Schachter
  • Computer Science
  • International Journal of Computer & Information…
  • 1 June 1980
This paper provides a unified discussion of the Delaunay triangulation over a planar set of points in the Euclidean plane. Expand
  • 1,016
  • 31
  • PDF
Travel-time prediction with support vector regression
  • Chun-Hsin Wu, J. Ho, D. Lee
  • Engineering, Computer Science
  • IEEE Transactions on Intelligent Transportation…
  • 1 December 2004
We demonstrate the feasibility of applying support vector regression (SVR) for travel-time prediction and prove that SVR is applicable and performs well for traffic data analysis. Expand
  • 554
  • 29
  • PDF
Securing web application code by static analysis and runtime protection
We created a lattice-based static analysis algorithm derived from type systems and typestate, and addressed its soundness. Expand
  • 621
  • 23
  • PDF
Medial Axis Transformation of a Planar Shape
  • D. Lee
  • Mathematics, Computer Science
  • IEEE Transactions on Pattern Analysis and Machine…
  • 1 April 1982
We present a 0(n log n) algorithm for computing the medial axis of a planar shape represented by an n-edge simple polygon. Expand
  • 497
  • 21
  • PDF
Euclidean shortest paths in the presence of rectilinear barriers
In this paper we address the problem of constructing a Euclidean shortest path between two specified points (source, destination) in the plane, which avoids a given set of barriers. Expand
  • 398
  • 19
On-Line Bin Packing in Linear Time
We present a new linear-time algorithm, the Modified Harmonic Algorithm and show, by a novel use of weighting functions, that it has an asymptotic worst-case performance ratio less than 3 2 + 1 9 + 1 222 = 1.(615) ∗ . Expand
  • 133
  • 18
Generalization of Voronoi Diagrams in the Plane
In this paper we study the Voronoi diagram for a set of N line segments and circles in the Euclidean plane. Expand
  • 325
  • 17