Sciweavers

264 search results - page 9 / 53
» Improved Visual Clustering of Large Multi-dimensional Data S...
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
14 years 9 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
BMCBI
2008
114views more  BMCBI 2008»
14 years 9 months ago
Visualizing and clustering high throughput sub-cellular localization imaging
Background: The expansion of automatic imaging technologies has created a need to be able to efficiently compare and review large sets of image data. To enable comparisons of imag...
Nicholas A. Hamilton, Rohan D. Teasdale
87
Voted
HIS
2004
14 years 11 months ago
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...
VIS
2004
IEEE
214views Visualization» more  VIS 2004»
15 years 10 months ago
Surface Reconstruction of Noisy and Defective Data Sets
We present a novel surface reconstruction algorithm that can recover high-quality surfaces from noisy and defective data sets without any normal or orientation information. A set ...
Hui Xie, Kevin T. McDonnell, Hong Qin
87
Voted

Publication
248views
14 years 6 months ago
Equalizer: A Scalable Parallel Rendering Framework
Continuing improvements in CPU and GPU performances as well as increasing multi-core processor and cluster-based parallelism demand for flexible and scalable parallel rendering sol...
Stefan Eilemann, Maxim Makhinya, Renato Pajarola