2219 search results - page 334 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
135
click to vote
PODC
2011
ACM
14 years 5 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
110
Voted
IVC
2007
15 years 2 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
174
Voted
CVPR
2009
IEEE
16 years 28 days ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
133
Voted
TCS
2011
14 years 9 months ago
2011
d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchroni...
134
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...