Sciweavers

555 search results - page 95 / 111
» Decompositions of Grammar Constraints
Sort
View
BMCBI
2008
98views more  BMCBI 2008»
13 years 8 months ago
GBNet: Deciphering regulatory rules in the co-regulated genes using a Gibbs sampler enhanced Bayesian network approach
Background: Combinatorial regulation of transcription factors (TFs) is important in determining the complex gene expression patterns particularly in higher organisms. Deciphering ...
Li Shen, Jie Liu, Wei Wang
DAC
2004
ACM
14 years 9 months ago
Off-chip latency-driven dynamic voltage and frequency scaling for an MPEG decoding
This paper describes a dynamic voltage and frequency scaling (DVFS) technique for MPEG decoding to reduce the energy consumption using the computational workload decomposition. Th...
Kihwan Choi, Ramakrishna Soma, Massoud Pedram
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
14 years 2 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
TNN
2010
148views Management» more  TNN 2010»
13 years 3 months ago
Generalized low-rank approximations of matrices revisited
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
Jun Liu, Songcan Chen, Zhi-Hua Zhou, Xiaoyang Tan