344 search results - page 15 / 69 » Random Walks on Colored Graphs |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
EMNLP
2011
12 years 7 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
AOSD
2007
ACM
13 years 11 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
ISCIS
2005
Springer
14 years 1 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...