5100 search results - page 619 / 1020 » The Linear Complexity of a Graph |
171
click to vote
AUSAI
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In the philosophy of behavior-based robotics, design of complex behavior needs the interaction of basic behaviors that are easily implemented. Action selection mechanism ...
159
click to vote
IWPC
2002
IEEE
15 years 11 months ago
2002
IEEE
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
229
Voted
METRICS
2002
IEEE
15 years 11 months ago
2002
IEEE
Maintaining software systems is getting more complex and difficult task, as the scale becomes larger. It is generally said that code clone is one of the factors that make softwar...
231
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
167
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...