Sciweavers

113 search results - page 17 / 23
» User-Adaptive Exploration of Multidimensional Data
Sort
View
DAMON
2007
Springer
14 years 1 months ago
In-memory grid files on graphics processors
Recently, graphics processing units, or GPUs, have become a viable alternative as commodity, parallel hardware for generalpurpose computing, due to their massive data-parallelism,...
Ke Yang, Bingsheng He, Rui Fang, Mian Lu, Naga K. ...
DIS
2009
Springer
14 years 2 months ago
Subspace Discovery for Promotion: A Cell Clustering Approach
The promotion analysis problem has been proposed in [16], where ranking-based promotion query processing techniques are studied to effectively and efficiently promote a given obje...
Tianyi Wu, Jiawei Han
ECCV
2002
Springer
14 years 9 months ago
Evaluating Image Segmentation Algorithms Using the Pareto Front
Image segmentation is the first stage of processing in many practical computer vision systems. While development of particular segmentation algorithms has attracted considerable re...
Mark Everingham, Henk L. Muller, Barry T. Thomas
SSDBM
2009
IEEE
116views Database» more  SSDBM 2009»
14 years 2 months ago
Constraint-Based Learning of Distance Functions for Object Trajectories
Abstract. With the drastic increase of object trajectory data, the analysis and exploration of trajectories has become a major research focus with many applications. In particular,...
Wei Yu, Michael Gertz
ICPP
2000
IEEE
14 years 2 days ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary