Sciweavers

1693 search results - page 104 / 339
» fast 2008
Sort
View
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 10 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
ICPR
2008
IEEE
14 years 10 months ago
Fast protein homology and fold detection with sparse spatial sample kernels
In this work we present a new string similarity feature, the sparse spatial sample (SSS). An SSS is a set of short substrings at specific spatial displacements contained in the or...
Pai-Hsi Huang, Pavel P. Kuksa, Vladimir Pavlovic
ICML
2008
IEEE
14 years 9 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
ICML
2008
IEEE
14 years 9 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul
ISBI
2008
IEEE
14 years 9 months ago
Fast displacement probability profile approximation from HARDI using 4th-order tensors
Cartesian tensor basis have been widely used to approximate spherical functions. In Medical Imaging, tensors of various orders have been used to model the diffusivity function in ...
Angelos Barmpoutis, Baba C. Vemuri, John R. Forder