2403 search results - page 219 / 481 » Optimal Randomized RANSAC |
132
Voted
NIPS
2004
15 years 5 months ago
2004
We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes super...
149
Voted
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
113
Voted
AAAI
1997
15 years 5 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
132
Voted
VISAPP
2007
15 years 4 months ago
2007
We consider the problem of image deconvolution. We foccus on a Bayesian approach which consists of maximizing an energy obtained by a Markov Random Field modeling. MRFs are classi...
141
Voted
COLOGNETWENTE
2009
15 years 4 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...