2527 search results - page 249 / 506 » Discrete optimization in computer vision |
150
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
195
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
184
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
195
click to vote
MIR
2010
ACM
15 years 10 months ago
2010
ACM
Mobile devices are increasingly powerful in media storage and rendering. The prevalent request of decent video browsing on mobile devices is demanding. However, one limitation com...
163
Voted
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...