9997 search results - page 28 / 2000 » The case for crowd computing |
ECCV
2006
Springer
15 years 24 days 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...
ECCV
2008
Springer
15 years 24 days ago
2008
Springer
Abstract. This paper presents an algorithm for tracking individual targets in high density crowd scenes containing hundreds of people. Tracking in such a scene is extremely challen...
NLE
2010
13 years 9 months ago
2010
In this article, we present a comprehensive study aimed at computing semantic relatedness of word pairs. We analyze the performance of a large number of semantic relatedness measu...
CVPR
2008
IEEE
15 years 28 days ago
2008
IEEE
The goal of this work is to find all people in archive films. Challenges include low image quality, motion blur, partial occlusion, non-standard poses and crowded scenes. We base ...
NSDI
2004
14 years 9 days ago
2004
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...