1258 search results - page 185 / 252 » Architecture-driven Problem Decomposition |
170
click to vote
CONCUR
2009
Springer
16 years 22 days ago
2009
Springer
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...
159
click to vote
CISS
2008
IEEE
16 years 19 days ago
2008
IEEE
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...
198
click to vote
ISCAS
2008
IEEE
16 years 17 days ago
2008
IEEE
— 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...
185
click to vote
MICRO
2005
IEEE
15 years 11 months ago
2005
IEEE
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...
163
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
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...