In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
Bonnie K. Ray, Hisashi Kashima, Jianying Hu, Monin...
The analysis of high-dimensional data is an important, yet inherently difficult problem. Projection techniques such as PCA, MDS, and SOM can be used to map high-dimensional data t...
Tobias Schreck, Tatiana von Landesberger, Sebastia...
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
In this paper, we describe the use of a cluster as a generalized facility for development. A development facility is a system used primarily for testing and development activities...