Sciweavers

1802 search results - page 101 / 361
» Sparse Computations with PEI
Sort
View
ITCC
2005
IEEE
15 years 3 months ago
A Scalable Generative Topographic Mapping for Sparse Data Sequences
We propose a novel, computationally efficient generative topographic model for inferring low dimensional representations of high dimensional data sets, designed to exploit data s...
Ata Kabán
PKDD
2004
Springer
168views Data Mining» more  PKDD 2004»
15 years 3 months ago
Combining Winnow and Orthogonal Sparse Bigrams for Incremental Spam Filtering
Spam filtering is a text categorization task that has attracted significant attention due to the increasingly huge amounts of junk email on the Internet. While current best-pract...
Christian Siefkes, Fidelis Assis, Shalendra Chhabr...
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
15 years 3 months ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
FPGA
2001
ACM
128views FPGA» more  FPGA 2001»
15 years 2 months ago
Using sparse crossbars within LUT
In FPGAs, the internal connections in a cluster of lookup tables (LUTs) are often fully-connected like a full crossbar. Such a high degree of connectivity makes routing easier, bu...
Guy G. Lemieux, David M. Lewis
ICA
2007
Springer
15 years 1 months ago
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...