5889 search results - page 458 / 1178 » Graph Layout Problems |
216
click to vote
ER
2008
Springer
15 years 9 months ago
2008
Springer
During data warehouse design, the designer frequently encounters the problem of choosing among different alternatives for the same design construct. The behavior of the chosen desi...
203
click to vote
MVA
2007
15 years 9 months ago
2007
In the last few years, computer vision and image processing techniques have been developed to solve many problems. One of them, graph cut method is powerful optimization technique...
179
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence betwe...
192
click to vote
DM
2008
15 years 7 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
229
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...