1172 search results - page 108 / 235 » Path Algorithms on Regular Graphs |
85
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
150
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
97
Voted
MM
2005
ACM
15 years 6 months ago
2005
ACM
To better understand the content of multimedia, a lot of research efforts have been made on how to learn from multi-modal feature. In this paper, it is studied from a graph point ...
107
Voted
GD
2009
Springer
15 years 5 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
93
Voted
DIS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...