Sciweavers

610 search results - page 53 / 122
» Fast Modular Reduction
Sort
View
EOR
2007
96views more  EOR 2007»
14 years 9 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...
ISCI
2007
138views more  ISCI 2007»
14 years 9 months ago
A fast algorithm for one-unit ICA-R
Independent component analysis (ICA) aims to recover a set of unknown mutually independent source signals from their observed mixtures without knowledge of the mixing coefficients...
Qiu-Hua Lin, Yong-Rui Zheng, Fuliang Yin, Hualou L...
JCB
2007
106views more  JCB 2007»
14 years 9 months ago
Clustered Sequence Representation for Fast Homology Search
We present a novel approach to managing redundancy in sequence databanks such as GenBank. We store clusters of near-identical sequences as a representative union-sequence and a se...
Michael Cameron, Yaniv Bernstein, Hugh E. Williams
TCSV
2002
78views more  TCSV 2002»
14 years 9 months ago
Local bandwidth constrained fast inverse motion compensation for DCT-domain video transcoding
DCT-based digital video coding standards such as MPEG and H.26x are becoming more widely adopted for multimedia applications. Since the standards differ in their format and syntax...
Shizhong Liu, Alan C. Bovik
ICCAD
2002
IEEE
160views Hardware» more  ICCAD 2002»
15 years 2 months ago
Folding of logic functions and its application to look up table compaction
The paper describes the folding method of logic functions to reduce the size of memories for keeping the functions. The folding is based on the relation of fractions of logic func...
Shinji Kimura, Takashi Horiyama, Masaki Nakanishi,...