Sciweavers

1258 search results - page 185 / 252
» Architecture-driven Problem Decomposition
Sort
View
CONCUR
2009
Springer
14 years 3 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
CISS
2008
IEEE
14 years 3 months ago
Network distribution capacity and content-pipe gap
Abstract— The growth of video content and diversification of content-sharing methods in the Internet lead to an exciting range of new problems in networking, communications, and...
Mung Chiang
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
14 years 3 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...
MICRO
2005
IEEE
126views Hardware» more  MICRO 2005»
14 years 2 months ago
Cost Sensitive Modulo Scheduling in a Loop Accelerator Synthesis System
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...
LATIN
2004
Springer
14 years 2 months ago
Cost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
Hervé Brönnimann, Marc Glisse