81 search results - page 9 / 17 » A Fast Random Sampling Algorithm for Sparsifying Matrices |
FCCM
2006
IEEE
14 years 1 months ago
2006
IEEE
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...
BMCBI
2007
13 years 7 months ago
2007
Background: Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such ...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
TIT
2008
13 years 7 months ago
2008
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
FOCS
2000
IEEE
14 years 1 days ago
2000
IEEE
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...