3471 search results - page 199 / 695 » Obstacle Numbers of Graphs |
138
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
133
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
2010
Eurographics
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
146
click to vote
WAW
2009
Springer
15 years 11 months ago
2009
Springer
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
131
click to vote
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
166
Voted
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...