1729 search results - page 303 / 346 » Bound Graph Polysemy |
144
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
133
Voted
ATVA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
128
click to vote
GD
2005
Springer
15 years 10 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
112
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent t...
140
Voted
MICAI
2005
Springer
15 years 10 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...