Sciweavers

524 search results - page 15 / 105
» On the Performance of Clustering in Hilbert Spaces
Sort
View
JC
2006
115views more  JC 2006»
14 years 10 months ago
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
We study the problem of multivariate integration on the unit cube for unbounded integrands. Our study is motivated by problems in statistics and mathematical finance, where unboun...
Benjamin J. Waterhouse, Frances Y. Kuo, Ian H. Slo...
82
Voted
CLUSTER
2006
IEEE
15 years 4 months ago
Designing High Performance and Scalable MPI Intra-node Communication Support for Clusters
As new processor and memory architectures advance, clusters start to be built from larger SMP systems, which makes MPI intra-node communication a critical issue in high performanc...
Lei Chai, Albert Hartono, Dhabaleswar K. Panda
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
78
Voted
BIBE
2003
IEEE
116views Bioinformatics» more  BIBE 2003»
15 years 3 months ago
An Assessment of a Metric Space Database Index to Support Sequence Homology
Hierarchical metric-space clustering methods have been commonly used to organize proteomes into taxonomies. Consequently, it is often anticipated that hierarchical clustering can ...
Rui Mao, Weijia Xu, Neha Singh, Daniel P. Miranker
ICML
2008
IEEE
15 years 11 months ago
Metric embedding for kernel classification rules
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
Bharath K. Sriperumbudur, Omer A. Lang, Gert R. G....