2799 search results - page 360 / 560 » The regenerator location problem |
164
click to vote
PPL
2007
15 years 6 months ago
2007
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
162
click to vote
ANOR
2011
15 years 1 months ago
2011
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
200
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. In this paper we investigate a new method of learning partbased models for visual object recognition, from training data that only provides information about class member...
202
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
249
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Illumination conditions cause problems for many computer vision algorithms. Inparticular, shadows in an image can cause segmentation, tracking, or recognition algorithms to fail. I...