3656 search results - page 529 / 732 » Compact Location Problems |
171
click to vote
TREC
2004
15 years 7 months ago
2004
This paper reports on work done for the Genomics Track at TREC 2004 by ConverSpeech LLC in conjunction with scientists at the Saccharomyces Genome Database (SGD), the model organi...
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...
199
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...
201
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...