942 search results - page 30 / 189 » Constraints in Graph Drawing Algorithms |
150
Voted
AI
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
125
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
117
Voted
RT
1999
Springer
15 years 6 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
116
click to vote
CHI
2010
ACM
15 years 9 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
122
click to vote
COGSCI
2010
15 years 2 months ago
2010
We used a new method to assess how people can infer unobserved causal structure from patterns of observed events. Participants were taught to draw causal graphs, and then shown a ...