2463 search results - page 290 / 493 » Rankings of Directed Graphs |
152
click to vote
ML
2011
ACM
14 years 10 months ago
2011
ACM
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
142
Voted
IWOMP
2007
Springer
15 years 9 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
121
Voted
ISIPTA
2003
IEEE
15 years 8 months ago
2003
IEEE
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symme...
115
Voted
APCHI
1998
IEEE
15 years 7 months ago
1998
IEEE
Direct manipulation interfaces are characterised according to the representation of the task domain: the domain objects and the effect of user operations on those objects. In the ...
115
Voted
IPPS
1996
IEEE
15 years 7 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...