Search For:

Displaying 1-14 out of 14 total
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
Found in: IEEE Transactions on Computers
By C.d. Yang, D.t. Lee, C.k. Wong
Issue Date:August 1997
pp. 930-941
<p><b>Abstract</b>—Smallest rectilinear paths are rectilinear paths with a minimum number of bends and with a minimum length simultaneously. In this paper, given two pairs of terminals within a rectilinear polygon, we derive an algorithm ...
 
Boosted Multiple Kernel Learning for Scene Category Recognition
Found in: Pattern Recognition, International Conference on
By I-Hong Jhuo, D.T. Lee
Issue Date:August 2010
pp. 3504-3507
Scene images typically include diverse and distinctive properties. It is reasonable to consider different features in establishing a scene category recognition system with a promising performance. We propose an adaptive model to represent various features ...
 
Out-of-Roundness Problem Revisited
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By V.B. Le, D.T. Lee
Issue Date:March 1991
pp. 217-223
<p>The properties and computation of the minimum radial separation (MRS) standard for out-of-roundness are discussed. Another standard out-of-roundness measurement called the minimum area difference (MAD) center is introduced. Although the two center...
 
Multi-party k-Means Clustering with Privacy Consideration
Found in: Parallel and Distributed Processing with Applications, International Symposium on
By Teng-Kai Yu, D.T. Lee, Shih-Ming Chang, Justin Zhan
Issue Date:September 2010
pp. 200-207
The k-means clustering algorithm is a widely used scheme to solve the clustering problem which classifies a given set of n data points in m-dimensional space into k clusters, whose centers are obtained by the centroids of the points in the same cluster. Th...
 
SinicView: An Interactive Visualization Tool for Comparison of Multiple Sequence Alignment Results
Found in: 2005 IEEE Computational Systems Bioinformatics Conference - Workshops
By Arthur Chun-Chieh Shih, D.T. Lee, Laurent Lin, Chin-Lin Peng, Shiang-Heng Chen, Chun-Yi Wong, Meng-Yuan Chou, Tze-Chang Shiao
Issue Date:August 2005
pp. 269-270
<p>In the initial stage of sequence analysis, a biologist is first faced with the questions about how to choose the best tool to align sequences of interest and how to analyze and visualize the alignment results, and then with the question about whet...
 
Topological Via Minimization Revisited
Found in: IEEE Transactions on Computers
By M. Sarrafzadeh, D.T. Lee
Issue Date:November 1991
pp. 1307-1312
<p>The topological via minimization problem in a two-layer environment is considered. A set of n two-terminal nets in a bounded region is given. The authors attempt to find a homotopy to assign nets to distinct layers so that no two nets on the same ...
 
Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices
Found in: Advanced Information Networking and Applications Workshops, International Conference on
By Tsai-Yeh Tung,Laurent Lin,D.T. Lee
Issue Date:March 2012
pp. 720-725
We propose the Pandora Messaging, an enhanced secure instant messaging architecture which is equipped with a self-message-destructing feature for sensitive personal information applications in a mobile environment. We design the Pandora Message Encryption ...
 
Integration of a Concept Map Generator and a Knowledge-Portal-Based E-learning System
Found in: Computer Science and Information Engineering, World Congress on
By Jyh-Da Wei, Tai-Yu Chen, Tsai-Yeh Tung, D.T. Lee
Issue Date:April 2009
pp. 356-360
Knowledge management (KM) is the research field aimed to create, organize, and store explicit knowledge for easy access and manipulation, whereas e-learning is concerned with delivering a suite of knowledge contents to a group of learners via the Internet....
 
Parallel algorithms for maximum matching in interval graphs
Found in: Parallel Processing Symposium, International
By M.G. Andrews, M.J. Atallah, D.Z. Chen, D.T. Lee
Issue Date:April 1995
pp. 84
Given a set of n intervals representing an interval graph, the problem of finding a maximum matching between pairs of disjoint (nonintersecting) intervals has been considered in the sequential model. We present parallel algorithms for computing maximum car...
 
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model
Found in: IEEE Transactions on Computers
By D.T. Lee, C.D. Yang, C.K. Wong
Issue Date:June 1994
pp. 711-724
<p>We consider problems of finding assorted rectilinear paths among rectilinear obstacles in a two-layer interconnection model according to the number of bends and the 1-layer distance (y-distance). Using a horizontal wave-front approach, optimal /sp...
 
Computational Geometry?A Survey
Found in: IEEE Transactions on Computers
By D.T. Lee, F.P. Preparata
Issue Date:December 1984
pp. 1072-1101
We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms. This newly emerged area of activities has found numerous applications in various...
   
An Optimal Illumination Region Algorithm for Convex Polygons
Found in: IEEE Transactions on Computers
By D.T. Lee, C.B., Jr. Silio
Issue Date:December 1982
pp. 1225-1227
For the convex polygon P having n vertices entirely contained in a convex polygon K having m vertices, an optimal algorithm with running time O(n + m) is presented to compute and name regions in the boundary of K from which it is possible to illuminate the...
 
A Microprocessor-Based Office Image Processing System
Found in: IEEE Transactions on Computers
By L.M. Ni, K.Y. Wong, D.T. Lee, R.K. Poon
Issue Date:October 1982
pp. 1017-1022
This paper presents a multiprocessor system architecture and the scheduling policies of the processors which can off-load a host computer in the image processing of office documents. The objective of this system is to provide extensive image processing cap...
 
An On-Chip Compare/Steer Bubble Sorter
Found in: IEEE Transactions on Computers
By D.T. Lee, Hsu Chang, C.K. Wong
Issue Date:June 1981
pp. 396-405
Two generic record-permutation bubble devices?the bubble ladder and the bubble string comparator?have been reported in the literature but not yet implemented. The former relies on the extensive use of external control lines, while the latter relies solely ...
 
 1