5316 search results - page 50 / 1064 » Which Search Problems Are Random |
158
Voted
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper presents an algorithm for order reduction of
factors in High-Order Markov Random Fields (HOMRFs).
Standard techniques for transforming arbitrary high-order
factors in...
119
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Though it has cost great research efforts for decades, object recognition is still a challenging problem. Traditional methods based on machine learning or computer vision are stil...
101
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
112
click to vote
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
113
Voted
ICIP
2010
IEEE
14 years 10 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...