2681 search results - page 158 / 537 » Problem F |
107
Voted
CCS
2007
ACM
15 years 4 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...
95
Voted
BMVC
2002
15 years 3 months 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
15 years 2 months 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...
90
Voted
ASIACRYPT
2008
Springer
15 years 2 months 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...
83
Voted
COCO
2008
Springer
15 years 2 months 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...