820 search results - page 96 / 164 » Inducing Temporal Graphs |
131
click to vote
LPAR
2004
Springer
15 years 8 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
111
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
143
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
113
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
A new algorithm is proposed for novel view generation in one-toone teleconferencing applications. Given the video streams acquired by two cameras placed on either side of a comput...
139
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...