Sciweavers

5100 search results - page 334 / 1020
» The Linear Complexity of a Graph
Sort
View
CISS
2008
IEEE
15 years 11 months ago
Information theory based estimator of the number of sources in a sparse linear mixing model
—In this paper we present an Information Theoretic Estimator for the number of sources mutually disjoint in a linear mixing model. The approach follows the Minimum Description Le...
Radu Balan
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
Human Motion Synthesis with Optimization-based Graphs
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 ...
Cheng Ren, Liming Zhao, Alla Safonova
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
15 years 10 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis
STACS
1992
Springer
15 years 9 months ago
Graph Isomorphism is Low for PP
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
Johannes Köbler, Uwe Schöning, Jacobo To...
AVI
2006
15 years 6 months ago
Task taxonomy for graph visualization
Our goal is to define a list of tasks for graph visualization that has enough detail and specificity to be useful to designers who want to improve their system and to evaluators w...
Bongshin Lee, Catherine Plaisant, Cynthia Sims Par...