1736 search results - page 200 / 348 » The rank-width of Directed Graphs |
151
click to vote
APCHI
1998
IEEE
15 years 10 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 ...
149
click to vote
IPPS
1996
IEEE
15 years 10 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...
200
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
This paper describes a novel system for creating virtual creatures that move and behave in simulated three-dimensional physical worlds. The morphologies of creatures and the neura...
143
click to vote
NIPS
2000
15 years 7 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
181
click to vote
AAAI
1990
15 years 7 months ago
1990
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...