1736 search results - page 295 / 348 » The rank-width of Directed Graphs |
125
click to vote
IEEEPACT
1997
IEEE
15 years 4 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
116
click to vote
CHI
1996
ACM
15 years 4 months ago
1996
ACM
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly f...
92
Voted
DAC
1996
ACM
15 years 4 months ago
1996
ACM
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
107
Voted
POPL
1996
ACM
15 years 4 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
108
click to vote
NN
1997
Springer
15 years 4 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...