5889 search results - page 170 / 1178 » Graph Layout Problems |
170
click to vote
MP
2007
15 years 5 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
140
click to vote
AEI
2008
15 years 6 months ago
2008
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
166
click to vote
NIPS
2004
15 years 7 months ago
2004
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
169
click to vote
TCS
2008
15 years 6 months ago
2008
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In t...
195
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...