2168 search results - page 128 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
170
click to vote
CVPR
2010
IEEE
16 years 10 days ago
2010
IEEE
Markerless tracking of human pose is a hard yet relevant problem. In this paper, we derive an efficient filtering algorithm for tracking human pose at 4-10 frames per second using...
130
click to vote
CCGRID
2007
IEEE
15 years 10 months ago
2007
IEEE
The successful execution of workflows using mobile services is dependant on the services behaving as expected. The management of this behaviour in Akogrimo is achieved by a contex...
119
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
We solve the consensus problem using a new class of broadcasts that are very appropriate to ad-hoc networking: every broadcast message is eventually ensured to be garbagecollected...
125
click to vote
ACL
2011
14 years 7 months ago
2011
Resolving coordination ambiguity is a classic hard problem. This paper looks at coordination disambiguation in complex noun phrases (NPs). Parsers trained on the Penn Treebank are...
112
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
This article presents a preceding car rear view tracking algorithm which utilizes a particle filter and belief function data fusion. Most of tracking applications resort to only o...