5606 search results - page 151 / 1122 » Randomization Techniques for Graphs. |
144
click to vote
COMGEO
1999
ACM
15 years 2 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
135
click to vote
INFOCOM
2010
IEEE
15 years 28 days 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...
261
click to vote
CVPR
2011
IEEE
14 years 10 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...
146
click to vote
EMNLP
2011
14 years 2 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...
118
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...