402 search results - page 35 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Robust foreground object segmentation via background modelling is a difficult problem in cluttered environments, where obtaining a clear view of the background to model i...
HEURISTICS
2008
13 years 7 months ago
2008
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
AUSAI
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Objects can exhibit different dynamics at different scales, and this is often exploited by visual tracking algorithms. A local dynamic model is typically used to extract image fea...