2681 search results - page 158 / 537 » Problem F |
CCS
2007
ACM
14 years 2 months ago
2007
ACM
We address the problem of using an untrusted server with only a trusted timestamping device (TTD) to provide trusted storage for a large number of clients, where each client may o...
BMVC
2002
14 years 24 days ago
2002
We consider the problem of learning how a person's face behaves in a long video sequence, with the aim of synthesising convincing sequences demonstrating the same behaviours....
AMDO
2008
Springer
14 years 12 days ago
2008
Springer
This paper describes a framework which exploits the use of computer animation to evaluate the performance of tracking algorithms. This can be achieved in two different, complementa...
ASIACRYPT
2008
Springer
14 years 12 days ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
COCO
2008
Springer
14 years 6 days ago
2008
Springer
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...