Sciweavers

1542 search results - page 32 / 309
» The metamathematics of random graphs
Sort
View
JCO
1998
136views more  JCO 1998»
14 years 9 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
INFOCOM
2010
IEEE
14 years 8 months ago
Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing
—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...
Yanhua Li, Zhi-Li Zhang
CVPR
2011
IEEE
14 years 5 months ago
Hyper-graph Matching via Reweighted Random Walks
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...
Jungmin Lee (Seoul National University), Minsu Cho...
EMNLP
2011
13 years 9 months ago
Random Walk Inference and Learning in A Large Scale Knowledge Base
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...
Ni Lao, Tom M. Mitchell, William W. Cohen
PAMI
2010
207views more  PAMI 2010»
14 years 4 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf