1679 search results - page 254 / 336 » Strong order equivalence |
DAC
2007
ACM
14 years 21 days ago
2007
ACM
While cryptographic algorithms are usually strong against mathematical attacks, their practical implementation, both in software and in hardware, opens the door to side-channel at...
ECCV
2010
Springer
14 years 21 days ago
2010
Springer
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
ANTSW
2006
Springer
14 years 16 days ago
2006
Springer
The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the sta...
ASIACRYPT
2006
Springer
14 years 16 days ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
CVPR
2004
IEEE
14 years 15 days ago
2004
IEEE
We formulate face localization as a Maximum A Posteriori Probability(MAP) problem of finding the best estimation of human face configuration in a given image. The a prior distribu...