2612 search results - page 357 / 523 » Assemblies as Graph Processes |
143
click to vote
VLSID
2002
IEEE
16 years 5 months ago
2002
IEEE
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
233
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...
158
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
139
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
124
click to vote
ISCIS
2009
Springer
15 years 11 months ago
2009
Springer
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...