344 search results - page 15 / 69 » Random Walks on Colored Graphs |
112
click to vote
INFOCOM
2010
IEEE
14 years 10 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...
219
click to vote
CVPR
2011
IEEE
14 years 7 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...
110
click to vote
EMNLP
2011
13 years 11 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...
102
click to vote
AOSD
2007
ACM
15 years 3 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
15 years 5 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...