Sciweavers

2826 search results - page 55 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
IPPS
1996
IEEE
14 years 1 months ago
Maximizing Speedup through Self-Tuning of Processor Allocation
We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of pr...
Thu D. Nguyen, Raj Vaswani, John Zahorjan
TKDE
2008
152views more  TKDE 2008»
13 years 9 months ago
SRDA: An Efficient Algorithm for Large-Scale Discriminant Analysis
Linear Discriminant Analysis (LDA) has been a popular method for extracting features that preserves class separability. The projection functions of LDA are commonly obtained by max...
Deng Cai, Xiaofei He, Jiawei Han
APVIS
2007
13 years 10 months ago
Interpreting large visual similarity matrices
Visual similarity matrices (VSMs) are a common technique for visualizing graphs and other types of relational data. While traditionally used for small data sets or well-ordered la...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
PAMI
1998
88views more  PAMI 1998»
13 years 8 months ago
Large-Scale Parallel Data Clustering
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
Dan Judd, Philip K. McKinley, Anil K. Jain
TVCG
2012
196views Hardware» more  TVCG 2012»
11 years 11 months ago
Robust Morse Decompositions of Piecewise Constant Vector Fields
—In this paper, we introduce a new approach to computing a Morse decomposition of a vector field on a triangulated manifold surface. The basic idea is to convert the input vector...
Andrzej Szymczak, Eugene Zhang