Sciweavers

746 search results - page 70 / 150
» Fast (Structured) Newton Computations
Sort
View
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 10 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
14 years 4 months ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens
NIPS
2008
13 years 11 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
BMCBI
2005
132views more  BMCBI 2005»
13 years 10 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer
PR
2008
178views more  PR 2008»
13 years 8 months ago
An effective and fast iris recognition system based on a combined multiscale feature extraction technique
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
Makram Nabti, Ahmed Bouridane