328 search results - page 43 / 66 » Algorithms for the edge-width of an embedded graph |
107
click to vote
EMSOFT
2010
Springer
14 years 9 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
GD
2009
Springer
15 years 4 months ago
2009
Springer
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
AAAI
2007
15 years 2 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
135
click to vote
BIOINFORMATICS
2008
14 years 12 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
DAC
2005
ACM
16 years 22 days ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...