• Publications
  • Influence
A simple on-line bin-packing algorithm
The one-dimensional on-line bin-packing problem is considered, A simple <italic>O</italic>(1)-space and <italic>O</italic>(<italic>n</italic>)-time algorithm, calledExpand
  • 340
  • 85
Robust visual domain adaptation with low-rank reconstruction
Visual domain adaptation addresses the problem of adapting the sample distribution of the source domain to the target domain, where the recognition task is intended but the data distributions areExpand
  • 253
  • 39
  • Open Access
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. Its geometric properties are reviewed and several applications are discussed. Two algorithms are presented for constructing theExpand
  • 981
  • 34
  • Open Access
Computational complexity of art gallery problems
We study the computational complexity of the art gallery problem originally posed by Klee, and its variations. Specifically, the problem of determining the minimum number of vertex guards that canExpand
  • 390
  • 32
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
Travel time is a fundamental measure in transportation. Accurate travel-time prediction also is crucial to the development of intelligent transportation systems and advanced traveler informationExpand
  • 504
  • 26
  • Open Access
Securing web application code by static analysis and runtime protection
Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions, especially since the recent sharp increase in remotely exploitable vulnerabilities have beenExpand
  • 604
  • 24
  • Open Access
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. This problem hadExpand
  • 395
  • 22
Medial Axis Transformation of a Planar Shape
  • D. Lee
  • Mathematics, Computer Science
  • IEEE Transactions on Pattern Analysis and Machine…
  • 1 April 1982
The medial axis transformation is a means first proposed by Blum to describe a shape. In this paper we present a 0(n log n) algorithm for computing the medial axis of a planar shape represented by anExpand
  • 484
  • 22
  • Open Access
On-Line Bin Packing in Linear Time
Abstract In this paper, we study the 1-dimensional on-line bin packing problem. A list of pieces, each of size between zero and unity are to be packed, in order of their arrival, into a minimumExpand
  • 129
  • 18
Generalized delaunay triangulation for planar graphs
  • D. Lee, A. K. Lin
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1 December 1986
We introduce the notion of generalized Delaunay triangulation of a planar straight-line graphG=(V, E) in the Euclidean plane and present some characterizations of the triangulation. It is shown thatExpand
  • 271
  • 17
  • Open Access