5889 search results - page 1000 / 1178 » Graph Layout Problems |
183
click to vote
FOSSACS
2007
Springer
16 years 12 days ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
177
click to vote
FPGA
2007
ACM
16 years 12 days ago
2007
ACM
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
152
click to vote
MFCS
2007
Springer
16 years 11 days ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
157
click to vote
FOCS
2006
IEEE
16 years 8 days ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
147
click to vote
MICRO
2006
IEEE
16 years 7 days ago
2006
IEEE
VLIW and EDGE (Explicit Data Graph Execution) architectures rely on compilers to form high-quality hyperblocks for good performance. These compilers typically perform hyperblock f...